520
\$\begingroup\$

So... uh... this is a bit embarrassing. But we don't have a plain "Hello, World!" challenge yet (despite having 35 variants tagged with , and counting). While this is not the most interesting code golf in the common languages, finding the shortest solution in certain esolangs can be a serious challenge. For instance, to my knowledge it is not known whether the shortest possible Brainfuck solution has been found yet.

Furthermore, while all of Wikipedia (the Wikipedia entry has been deleted but there is a copy at archive.org ), esolangs and Rosetta Code have lists of "Hello, World!" programs, none of these are interested in having the shortest for each language (there is also this GitHub repository). If we want to be a significant site in the code golf community, I think we should try and create the ultimate catalogue of shortest "Hello, World!" programs (similar to how our basic quine challenge contains some of the shortest known quines in various languages). So let's do this!

The Rules

  • Each submission must be a full program.
  • The program must take no input, and print Hello, World! to STDOUT (this exact byte stream, including capitalization and punctuation) plus an optional trailing newline, and nothing else.
  • The program must not write anything to STDERR.
  • If anyone wants to abuse this by creating a language where the empty program prints Hello, World!, then congrats, they just paved the way for a very boring answer.

    Note that there must be an interpreter so the submission can be tested. It is allowed (and even encouraged) to write this interpreter yourself for a previously unimplemented language.

  • Submissions are scored in bytes, in an appropriate (pre-existing) encoding, usually (but not necessarily) UTF-8. Some languages, like Folders, are a bit tricky to score - if in doubt, please ask on Meta.
  • This is not about finding the language with the shortest "Hello, World!" program. This is about finding the shortest "Hello, World!" program in every language. Therefore, I will not mark any answer as "accepted".
  • If your language of choice is a trivial variant of another (potentially more popular) language which already has an answer (think BASIC or SQL dialects, Unix shells or trivial Brainfuck-derivatives like Alphuck), consider adding a note to the existing answer that the same or a very similar solution is also the shortest in the other language.

As a side note, please don't downvote boring (but valid) answers in languages where there is not much to golf - these are still useful to this question as it tries to compile a catalogue as complete as possible. However, do primarily upvote answers in languages where the authors actually had to put effort into golfing the code.

For inspiration, check the Hello World Collection.

The Catalogue

The Stack Snippet at the bottom of this post generates the catalogue from the answers a) as a list of shortest solution per language and b) as an overall leaderboard.

To make sure that your answer shows up, please start your answer with a headline, using the following Markdown template:

## Language Name, N bytes

where N is the size of your submission. If you improve your score, you can keep old scores in the headline, by striking them through. For instance:

## Ruby, <s>104</s> <s>101</s> 96 bytes

If there you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the last number in the header:

## Perl, 43 + 2 (-p flag) = 45 bytes

You can also make the language name a link which will then show up in the snippet:

## [><>](https://esolangs.org/wiki/Fish), 121 bytes

/* Configuration */

var QUESTION_ID = 55422; // Obtain this from the url
// It will be like https://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page
var ANSWER_FILTER = "!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe";
var COMMENT_FILTER = "!)Q2B_A2kjfAiU78X(md6BoYk";
var OVERRIDE_USER = 8478; // This should be the user ID of the challenge author.

/* App */

var answers = [], answers_hash, answer_ids, answer_page = 1, more_answers = true, comment_page;

function answersUrl(index) {
  return "https://api.stackexchange.com/2.2/questions/" +  QUESTION_ID + "/answers?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + ANSWER_FILTER;
}

function commentUrl(index, answers) {
  return "https://api.stackexchange.com/2.2/answers/" + answers.join(';') + "/comments?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + COMMENT_FILTER;
}

function getAnswers() {
  jQuery.ajax({
    url: answersUrl(answer_page++),
    method: "get",
    dataType: "jsonp",
    crossDomain: true,
    success: function (data) {
      answers.push.apply(answers, data.items);
      answers_hash = [];
      answer_ids = [];
      data.items.forEach(function(a) {
        a.comments = [];
        var id = +a.share_link.match(/\d+/);
        answer_ids.push(id);
        answers_hash[id] = a;
      });
      if (!data.has_more) more_answers = false;
      comment_page = 1;
      getComments();
    }
  });
}

function getComments() {
  jQuery.ajax({
    url: commentUrl(comment_page++, answer_ids),
    method: "get",
    dataType: "jsonp",
    crossDomain: true,
    success: function (data) {
      data.items.forEach(function(c) {
        if (c.owner.user_id === OVERRIDE_USER)
          answers_hash[c.post_id].comments.push(c);
      });
      if (data.has_more) getComments();
      else if (more_answers) getAnswers();
      else process();
    }
  });  
}

getAnswers();

var SCORE_REG = /<h\d>\s*([^\n,<]*(?:<(?:[^\n>]*>[^\n<]*<\/[^\n>]*>)[^\n,<]*)*),.*?(\d+)(?=[^\n\d<>]*(?:<(?:s>[^\n<>]*<\/s>|[^\n<>]+>)[^\n\d<>]*)*<\/h\d>)/;

var OVERRIDE_REG = /^Override\s*header:\s*/i;

function getAuthorName(a) {
  return a.owner.display_name;
}

function process() {
  var valid = [];
  
  answers.forEach(function(a) {
    var body = a.body;
    a.comments.forEach(function(c) {
      if(OVERRIDE_REG.test(c.body))
        body = '<h1>' + c.body.replace(OVERRIDE_REG, '') + '</h1>';
    });
    
    var match = body.match(SCORE_REG);
    if (match)
      valid.push({
        user: getAuthorName(a),
        size: +match[2],
        language: match[1],
        link: a.share_link,
      });
    else console.log(body);
  });
  
  valid.sort(function (a, b) {
    var aB = a.size,
        bB = b.size;
    return aB - bB
  });

  var languages = {};
  var place = 1;
  var lastSize = null;
  var lastPlace = 1;
  valid.forEach(function (a) {
    if (a.size != lastSize)
      lastPlace = place;
    lastSize = a.size;
    ++place;
    
    var answer = jQuery("#answer-template").html();
    answer = answer.replace("{{PLACE}}", lastPlace + ".")
                   .replace("{{NAME}}", a.user)
                   .replace("{{LANGUAGE}}", a.language)
                   .replace("{{SIZE}}", a.size)
                   .replace("{{LINK}}", a.link);
    answer = jQuery(answer);
    jQuery("#answers").append(answer);

    var lang = a.language;
    lang = jQuery('<a>'+lang+'</a>').text();
    
    languages[lang] = languages[lang] || {lang: a.language, lang_raw: lang, user: a.user, size: a.size, link: a.link};
  });

  var langs = [];
  for (var lang in languages)
    if (languages.hasOwnProperty(lang))
      langs.push(languages[lang]);

  langs.sort(function (a, b) {
    if (a.lang_raw.toLowerCase() > b.lang_raw.toLowerCase()) return 1;
    if (a.lang_raw.toLowerCase() < b.lang_raw.toLowerCase()) return -1;
    return 0;
  });

  for (var i = 0; i < langs.length; ++i)
  {
    var language = jQuery("#language-template").html();
    var lang = langs[i];
    language = language.replace("{{LANGUAGE}}", lang.lang)
                       .replace("{{NAME}}", lang.user)
                       .replace("{{SIZE}}", lang.size)
                       .replace("{{LINK}}", lang.link);
    language = jQuery(language);
    jQuery("#languages").append(language);
  }

}
body {
  text-align: left !important;
  display: block !important;
}

#answer-list {
  padding: 10px;
  width: 290px;
  float: left;
}

#language-list {
  padding: 10px;
  width: 500px;
  float: left;
}

table thead {
  font-weight: bold;
}

table td {
  padding: 5px;
}
<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script>
<link rel="stylesheet" type="text/css" href="https://cdn.sstatic.net/Sites/codegolf/all.css?v=ffb5d0584c5f">
<div id="language-list">
  <h2>Shortest Solution by Language</h2>
  <table class="language-list">
    <thead>
      <tr><td>Language</td><td>User</td><td>Score</td></tr>
    </thead>
    <tbody id="languages">

    </tbody>
  </table>
</div>
<div id="answer-list">
  <h2>Leaderboard</h2>
  <table class="answer-list">
    <thead>
      <tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr>
    </thead>
    <tbody id="answers">

    </tbody>
  </table>
</div>
<table style="display: none">
  <tbody id="answer-template">
    <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr>
  </tbody>
</table>
<table style="display: none">
  <tbody id="language-template">
    <tr><td>{{LANGUAGE}}</td><td>{{NAME}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr>
  </tbody>
</table>

\$\endgroup\$
21
  • 4
    \$\begingroup\$ @isaacg No it doesn't. I think there would be some interesting languages where it's not obvious whether primality testing is possible. \$\endgroup\$ Aug 28, 2015 at 13:56
  • 7
    \$\begingroup\$ If the same program, such as "Hello, World!", is the shortest in many different and unrelated languages, should it be posted separately? \$\endgroup\$ Aug 28, 2015 at 15:33
  • 2
    \$\begingroup\$ @mbomb007 Well it's hidden by default because the three code blocks take up a lot of space. I could minify them so that they are a single line each, but I'd rather keep the code maintainable in case bugs come up. \$\endgroup\$ Aug 28, 2015 at 19:34
  • 8
    \$\begingroup\$ @ETHproductions "Unlike our usual rules, feel free to use a language (or language version) even if it's newer than this challenge." Publishing the language and an implementation before posting it would definitely be helpful though. \$\endgroup\$ Aug 29, 2015 at 23:01
  • 2
    \$\begingroup\$ @MartinEnder ... Almost. If two BF solutions have the same size, the one with smaller lexicographical order will take smaller number of bytes in Unary. Of course the smallest Unary solution translated to BF is guaranteed to be smallest. \$\endgroup\$
    – DELETE_ME
    May 20, 2018 at 10:20

984 Answers 984

1
27 28
29
30 31
33
1
\$\begingroup\$

2Col, 2 bytes

HW

Hooray, another boring answer using a Hello world builtin.

\$\endgroup\$
8
  • \$\begingroup\$ Does this print Hello, World! exactly or some variant of it? \$\endgroup\$
    – Beta Decay
    May 24, 2017 at 11:56
  • \$\begingroup\$ @BetaDecay prints it exactly, followed by a trailing newline \$\endgroup\$
    – Mayube
    May 24, 2017 at 12:15
  • \$\begingroup\$ Oh nice. A few answers have had built ins which don't print it correctly \$\endgroup\$
    – Beta Decay
    May 24, 2017 at 12:16
  • 1
    \$\begingroup\$ The general convention when it comes to hello world programs is Hello, World! so I made HW do exactly that. Of course I'm screwed if somebody asks me to print Hello World! or Hello World \$\endgroup\$
    – Mayube
    May 24, 2017 at 12:17
  • \$\begingroup\$ Can we get a link to more information about 2Col? [Edit: Nevermind I found the GitHub repo. github.com/gunnerwolf/2col] \$\endgroup\$
    – 3D1T0R
    May 29, 2018 at 16:24
1
\$\begingroup\$

HadesLang, 20 19 bytes

-1 byte thanks to Oliver

out:'Hello, World!'
\$\endgroup\$
4
  • \$\begingroup\$ Welcome to PPCG! The output should be Hello, World!, not Hello world!. Also, there's an escaped dot in your link; it is broken for me. \$\endgroup\$
    – Dennis
    May 31, 2018 at 19:55
  • \$\begingroup\$ Based on the docs, it looks like you can omit the brackets: out:'Hello, World!' \$\endgroup\$
    – Oliver
    May 31, 2018 at 20:08
  • \$\begingroup\$ Uppercase that w, and your answer will look valid :-) Also, welcome to PPCG, we're glad you're here! \$\endgroup\$
    – Oliver
    May 31, 2018 at 20:26
  • \$\begingroup\$ @Oliver Thanks! Will do! :) \$\endgroup\$
    – Azeros
    May 31, 2018 at 20:27
1
\$\begingroup\$

brainfuck, 137 bytes

++++++++++[>+>+++>+++++++>++++++++++<<<<-]>>>++.>+.+++++++..+++.<<++++++++++++++.------------.>+++++++++++++++.>.+++.------.--------.<<+.

Try it online!


Explained :

++++++++++[>+>+++>+++++++>++++++++++<<<<-]>>>++.                       H
>+.                                                                    e
+++++++..                                                             l l
+++.                                                                   o
<<++++++++++++++.                                                    comma
------------.                                                        space
>+++++++++++++++.                                                      W
>.                                                                     o
+++.                                                                   r
------.                                                                l
--------.                                                              d
<<+.                                                                   !

This can definitely be golfed. (World record is 72 bytes so I already know that)


This is basic hard coded answer, simply gets the Ascii value, resets and keeps going

brainfuck, 210 bytes

-[>+<-------]>-.[-]<-[>++<-----]>-.+++++++..[-]>+[+>+[<]>->]<.[-]--[>+<++++++]>+.[-]>-[-[-<]>>+<]>-.[-]-[>+<---]>++.[-]>+[+>+[<]>->]<.[-]>+[-->++[<]>-]>.[-]>+[++[++>]<<+]>+.[-]-[>++<-----]>--.[-]>-[-[-<]>>+<]>.

Try it online!

Explained :

-[>+<-------]>-.                                               H
[-]                                                             
<-[>++<-----]>-.                                               e
+++++++..                                                     l l
[-]                                               
>+[+>+[<]>->]<.                                                o
[-]
--[>+<++++++]>+.                                               ,
[-]
>-[-[-<]>>+<]>-.                                             space  
[-]
-[>+<---]>++.                                                  W
[-]
>+[+>+[<]>->]<.                                                o
[-]
>+[-->++[<]>-]>.                                               r
[-]
>+[++[++>]<<+]>+.                                              l
[-]
-[>++<-----]>--.                                               d
[-]
>-[-[-<]>>+<]>.                                                !
\$\endgroup\$
1
\$\begingroup\$

Thing, 37 bytes

Pushes the characters to the stack one by one (the second "l" is made with duplication, saving 1 byte), then concatenates them.

\!\d\l\r\o\W\ \,\o\ld\e\H++++++++++++

Try it online!

\$\endgroup\$
1
\$\begingroup\$

TapeBagel, 511 bytes

%% %++ %++ %++ %++ %++ %++ %++ %++ @* ## %++ %++ %++ %++ %++ @* ## %++
%++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ @* @* ## %++ %++ %++ %++
%++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ @* ## @* %++ %++ %++ %++
%++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++
%++ %++ @* ## %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++
%++ %++ @* ## %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++ %++
%++ %++ %++ %++ %++ @* ##  %++ %++ %++ %++ %++ %++ %++ %++ %++ %++
%++ %++ @* ## %++ %++ %++ %++ @* ##

%# - adds one to the integer index.

%% - resets the integer index to zero.

%& - the integer that the integer index is pointing to is inputted into the program.

#% - sets all of the integers to one.

## - resets all of the integers to zero.

&& - pauses the program.

&@ - clears the screen.

%++ - adds one to the integer that the integer index is pointing to

@[ int ] - outputs the integer as a character (1 = A, 2 = B, ... 26 = Z)

* - integer 0

\$\endgroup\$
1
\$\begingroup\$

Sisi, 21 bytes

0print"Hello, World!"

Try it online!

\$\endgroup\$
0
1
\$\begingroup\$

Q#, 43 bytes

function H():String{return"Hello, World!";}

Try it online!

Might as well put it out there. Q# is Microsoft's programming language for quantum computers, not that there's anything quantum happening here.

"Now hold on a moment! This isn't a complete program!"--You, probably.

Well, it's not actually possible to write a complete program in Q#. You always have to call it from a different language. So I'm just submitting a "function", although note that while Q# is a .NET language, the function keyword actually defines a class and not a method, and the submission is equivalent to the following C# code:

public class H : Operation<QVoid, String>, ICallable
{
    public H(IOperationFactory m) : base(m)
    {
    }

    String ICallable.Name => "H";
    String ICallable.FullName => "qsharp.H";
    public override Func<QVoid, String> Body => (__in) =>
    {
        return "Hello, World!";
    }

    ;
    public override void Init()
    {
    }

    public override IApplyData __dataIn(QVoid data) => data;
    public override IApplyData __dataOut(String data) => new QTuple<String>(data);
    public static System.Threading.Tasks.Task<String> Run(IOperationFactory __m__)
    {
        return __m__.Run<H, QVoid, String>(QVoid.Instance);
    }
}

You can use this link to "disassemble" Q#.

\$\endgroup\$
1
  • \$\begingroup\$ *transpile, not disassemble \$\endgroup\$
    – ASCII-only
    Dec 26, 2018 at 0:44
1
\$\begingroup\$

µ6, 25 bytes

,200,245,300,300,303,112,52,223,303,310,300,244,53

Try it online!

Explanation

Just apply the ASCII code-points to the pairing function , - strings/string-manipulation is not really the strength of µ6 (I guess nothing really is).

\$\endgroup\$
1
\$\begingroup\$

ABC, 21 bytes

WRITE "Hello, World!"

Try it online!

\$\endgroup\$
1
\$\begingroup\$

ABC-assembler, 80 39 bytes

.start s
s
 print "Hello, World!"
 halt

Try it online!

\$\endgroup\$
4
  • \$\begingroup\$ 78? \$\endgroup\$
    – ASCII-only
    Dec 25, 2018 at 22:42
  • \$\begingroup\$ @ASCII-only even shorter actually. \$\endgroup\$
    – Οurous
    Dec 25, 2018 at 22:46
  • 1
    \$\begingroup\$ Haha, I almost got that :P where are the docs for this btw \$\endgroup\$
    – ASCII-only
    Dec 25, 2018 at 22:47
  • \$\begingroup\$ @ASCII-only there's a paper here but there aren't really any. \$\endgroup\$
    – Οurous
    Dec 25, 2018 at 22:51
1
\$\begingroup\$

LC-3 object file, 36 bytes

.ORIG x3000
LEA R0, TEXT
TRAP x22
HALT
TEXT .STRINGZ "Hello, World!"
.END

This compiles to an object file:

ibug@ubuntu:~ $ hexdump -Cv hello.obj
00000000  30 00 e0 02 f0 22 f0 25  00 48 00 65 00 6c 00 6c  |0....".%.H.e.l.l|
00000010  00 6f 00 2c 00 20 00 57  00 6f 00 72 00 6c 00 64  |.o.,. .W.o.r.l.d|
00000020  00 21 00 00                                       |.!..|
00000024
ibug@ubuntu:~ $ stat -c "%s" hello.obj
36
ibug@ubuntu:~ $
\$\endgroup\$
1
\$\begingroup\$

JVM bytecode (OpenJDK asmtools JASM), 235 bytes

public class h {public static Method main:"([Ljava/lang/String;)V" stack 2 locals 1 {getstatic java/lang/System.out:"Ljava/io/PrintStream;";ldc "Hello, World!";invokevirtual java/io/PrintStream.println:"(Ljava/lang/String;)V";return;}}

Ungolfed

public class h {
    public static Method main:"([Ljava/lang/String;)V" stack 2 locals 1 {
        getstatic java/lang/System.out:"Ljava/io/PrintStream;";
        ldc "Hello, World!";
        invokevirtual java/io/PrintStream.println:"(Ljava/lang/String;)V";
        return;
    }
}

Pretty much the same thing as Jasmin, just with a different syntax.

\$\endgroup\$
1
  • \$\begingroup\$ I just found out about a static method sun.misc.MessageUtils.out from this answer. It does the same thing as System.out.println but should work out to be substantially shorter because it's a static call rather than virtual call. \$\endgroup\$ Aug 28, 2019 at 21:14
1
\$\begingroup\$

JS (Windows Script Host), 25 bytes

WSH.Echo("Hello, World!")

I don't know if someone did already post Windows Script Host JS.

\$\endgroup\$
1
  • 1
    \$\begingroup\$ Different languages should usually go in separate answers. Especially in challenges like this one which has an automatic leaderboard - only your first language shows up there. \$\endgroup\$ Mar 22, 2019 at 1:14
1
\$\begingroup\$

VBS (Windows Script Host), 26 bytes

WScript.Echo "Hello, World!"
\$\endgroup\$
1
\$\begingroup\$

Scala, 63 bytes

object Main{def main(a:Array[String])=print("Hello, World!")}

Try it online!

\$\endgroup\$
5
  • \$\begingroup\$ an existing answer is shorter \$\endgroup\$
    – ASCII-only
    May 4, 2019 at 2:14
  • \$\begingroup\$ That shorter answer doesn't work in tio. One of the requirements in this particular assignment was that each submission must be a full program. \$\endgroup\$
    – Peter
    May 4, 2019 at 5:50
  • \$\begingroup\$ Also, that answer has extra \n in the string. \$\endgroup\$
    – Peter
    May 4, 2019 at 5:57
  • \$\begingroup\$ The shorter one, sure. But not the longer one, which is still shorter than yours. Plus, yours is the one with extra newline, and incorrect capitalization for the W :| \$\endgroup\$
    – ASCII-only
    May 4, 2019 at 10:08
  • \$\begingroup\$ You are right, that answer is better and provides full version that works in tio. \$\endgroup\$
    – Peter
    May 4, 2019 at 17:52
1
\$\begingroup\$

VTL-2, 21 bytes

1 ?="Hello, World!"

? is the I/O system variable in VTL-2. Byte count may seem off, but line numbers are always two bytes, and the CR at the end of the line is mandatory and counted. Space between line numbers and commands is also mandatory.

\$\endgroup\$
1
\$\begingroup\$

Keg, 15 bytes

Hello\, world\!

Keg pushes all of the unrecognized commands onto the stack (with , and ! escaped). After the program terminates, it prints the content of the stack.

\$\endgroup\$
1
  • \$\begingroup\$ Now I feel bad. \$\endgroup\$
    – user85052
    Aug 10, 2019 at 7:58
1
\$\begingroup\$

33, 16 bytes

"Hello, World!"p

But that's boring, isn't it? Let's try with functions, instead.

56 bytes

{"Hello"p}'Hello'{", "p}', '{"World"p}'World'{"!"pi}qqqq

Here's something to be explained.

The string registers are initialised to "" when the interpreter starts. When the interpreter encounters a {, it copies all the code until the matching } and stores it as a function, labelled as what the destination string register was at the time (The destination string is set by single quotes).

Changes to the registers persist when changing stack frames (is that the right term?), so the explanation looks like this:

{                                                         (Creates function "")
  "Hello"                                                 (Stores "Hello" in the source string register)
         p                                                (Prints what is in the source string register)
          }'Hello'{                                       (Creates function "Hello")
                   ", "p                                  (Prints ", " after storing it in the source string register)
                        }', '{                            (Creates function ", ")
                              "World"p                    (Prints "World" after storing it in the source string register)
                                      }'World'{           (Creates function "World")
                                               "!"p       (Prints "!")
                                                   i      (Prints a newline)
                                                    }q    (Calls function "")
                                                      q   (Calls function "Hello")
                                                       q  (Calls function ", ")
                                                        q (Calls function "World")

This is a language I created. The source is in the link. I haven't made a Windows release of the interpreter yet, because I cannot figure out how to cross-compile. If you're on Windows, you'll have to compile it yourself.

\$\endgroup\$
1
\$\begingroup\$

anyfix, 14 bytes

“Hello, World!”

Simply the string, pushed onto the stack. Really boring.

(By the way, just use postfix for all operators in anyfix; this leads to the least confusion compared to infix modes and prefix modes, and anyfix is the easiest to understand in the postfix mode.)

TIO

\$\endgroup\$
1
\$\begingroup\$

Simula (cim), 24 bytes

OutText("Hello, World!")

Try it online!

Over 750 answers and we can still find languages not yet submitted. Wowsers.

\$\endgroup\$
1
\$\begingroup\$

Intcode

Since Advent of Code will inevitably be adding more features to Intcode as this year's event progresses, I'll just treat the separate revisions as different languages, and add to this if a new one makes it shorter.

Day 2, N/A Bytes

Having no real way of outputting multiple values yet, the version in day 2 can't do a proper Hello World.

There is technically this 42-byte solution, but it feels like cheating because I'm pretty sure no interpreter can run it:

1,3,5,0,99,5735816763073854918203775149089

This program copies that really long number to memory location 0 (which counts as output) and then halts. The really long number happens to be Hello, World! when read in bigendian form as a string.

Day 5, 89 Bytes

In day 5, dedicated I/O instructions are added, so a proper Hello World is possible. The ability to use immediate values doesn't hurt either.

104,72,104,101,104,108,4,5,104,111,104,44,104,32,104,87,4,9,104,114,4,5,104,100,104,33,99
\$\endgroup\$
1
\$\begingroup\$

Java, 82 bytes:

class Main{public static void main(String[]a){System.out.print("Hello, World!");}}
\$\endgroup\$
1
  • 1
    \$\begingroup\$ @JoKing I think it's intended to be some kind of proof of the length - "look, it really is 82 bytes!" - but of course you could trivially verify the byte count by copy-pasting it into a text editor, so I agree that it's unnecessary. \$\endgroup\$
    – F1Krazy
    Dec 6, 2019 at 11:12
1
\$\begingroup\$

Wren, 29 bytes

System.print("Hello, World!")

Try it online!

Explanation

System.print(               ) // Output the following string:
             "Hello, World!"  // "Hello, World!"
\$\endgroup\$
1
\$\begingroup\$

Intcode, 83 72 70 bytes

204,8,109,1,1205,8,0,99,72,101,108,108,111,44,32,87,111,114,108,100,33

Try it online!

Old 83 byte version:

1106,0,17,72,101,108,108,111,44,32,87,111,114,108,100,33,0,204,3,109,1,1205,3,17,99
\$\endgroup\$
2
  • \$\begingroup\$ Consider a TIO link using your own interpreter for now? like so \$\endgroup\$
    – Value Ink
    Dec 27, 2019 at 2:30
  • \$\begingroup\$ @ValueInk Done. \$\endgroup\$ Dec 27, 2019 at 2:31
1
\$\begingroup\$

tq, 15 bytes

"Hello, World!"

Pretty much just defines a list with the only item as the string "Hello, World!".

\$\endgroup\$
1
\$\begingroup\$

KRC, 17 bytes

This defines a function returning the string "Hello, World!". No trailing newline because it's shorter. (I've made a repl.it for KRC.)

f="Hello, World!"

Demo:

$ ./krc demo/hello
Kent Recursive Calculator 1.0
revised 2016.03.31
/h for help
krc> f!
Hello, World!krc>
\$\endgroup\$
1
\$\begingroup\$

><>, 25 bytes

!v"!dlroW ,olleH"!
o>l?!;

Try it online!

My second answer in this language so far, started learning only today, thought this would be a good starting point

\$\endgroup\$
1
\$\begingroup\$

Deadfish~, 1 byte

w

Try it online!

\$\endgroup\$
1
\$\begingroup\$

evil, 70 bytes

aeeeaeeewueuueweeueeuewwaaaweaaewaeaawueweeeaeeewaaawueeueweeaweeeueuw

Try it online!

\$\endgroup\$
4
  • 1
    \$\begingroup\$ Just in case you missed it, there is a shorter evil solution, posted by my pronoun is monicareinstate 2 months ago. \$\endgroup\$
    – manatwork
    Jun 19, 2020 at 0:36
  • \$\begingroup\$ @manatwork oh whoops. does that mean I should take this down? \$\endgroup\$
    – AdamS
    Jun 19, 2020 at 12:37
  • \$\begingroup\$ No, there is nothing against such solutions. Mentioned it more as fun fact. \$\endgroup\$
    – manatwork
    Jun 19, 2020 at 15:51
  • 1
    \$\begingroup\$ Actually I also missed the relevant one: grc posted this exact evil solution 4 years 6 months ago. ☹ \$\endgroup\$
    – manatwork
    Jun 21, 2020 at 2:47
1
\$\begingroup\$

Scala 3, 34 bytes

@main
def m=print("Hello, World!")

Thought Dotty deserved its own answer.

Try it in Scastie

\$\endgroup\$
1
27 28
29
30 31
33

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.