404
\$\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\$
  • 1
    \$\begingroup\$ Must the language meet our usual requirements for what a programming language is, or are we operating by kolmogorov complexity rules? \$\endgroup\$ – isaacg Aug 28 '15 at 13:54
  • 2
    \$\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\$ – Martin Ender Aug 28 '15 at 13:56
  • 6
    \$\begingroup\$ If the same program, such as "Hello, World!", is the shortest in many different and unrelated languages, should it be posted separately? \$\endgroup\$ – aditsu Aug 28 '15 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\$ – Martin Ender Aug 28 '15 at 19:34
  • 7
    \$\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\$ – Martin Ender Aug 29 '15 at 23:01

742 Answers 742

1
\$\begingroup\$

UniBasic, 19 Bytes

CRT 'Hello, World!'
\$\endgroup\$
1
\$\begingroup\$

Processing, 23 bytes

print("Hello, World!");


Well, that's pretty much it!

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

G*, 15 bytes

p Hello, World!

Pretty simple.

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

Stringy, 17 bytes

(Hello, World!);p
\$\endgroup\$
1
\$\begingroup\$

Pip, 15 bytes

"Hello, World!"

Straightforward. Any expression at the end of the program is auto-printed.

\$\endgroup\$
  • \$\begingroup\$ Out of curiosity, dose Pip have auto-closing end quotes? Or is that impractical for an infix language? \$\endgroup\$ – Conor O'Brien Sep 16 '16 at 1:23
  • \$\begingroup\$ @ConorO'Brien It would certainly have been possible, I just decided I didn't like it for aesthetic reasons. \$\endgroup\$ – DLosc Sep 16 '16 at 3:06
  • \$\begingroup\$ Fair enough. :D \$\endgroup\$ – Conor O'Brien Sep 16 '16 at 3:06
1
\$\begingroup\$

Aysolang - 30 23 bytes

{dlrow, olleH};
l0=?;o

Explaination:

{dlrow, olleH}; ~~ Push the ascii values of "Hello, world" on the stack, reversed and terminate the line
l0=             ~~ Check if the length equals zero
?;o             ~~ If it equals zero, terminate. Otherwise, output the top of the stack as a character.
\$\endgroup\$
1
\$\begingroup\$

Chaîne, 13 bytes

Hello, World!

Everything is an implicit string, and everything is implicit output.

\$\endgroup\$
  • 1
    \$\begingroup\$ Ooh, fancy i-like character~ Also an interesting language. \$\endgroup\$ – Addison Crump Nov 1 '15 at 18:12
1
\$\begingroup\$

Microscript II, 15 bytes

"Hello, World!"
\$\endgroup\$
1
\$\begingroup\$

SuperCollider, 27 bytes

"Hello, World!".post;1.exit
\$\endgroup\$
  • \$\begingroup\$ Where is the documentation for SuperCollider? \$\endgroup\$ – user48538 Jan 11 '16 at 4:42
  • \$\begingroup\$ @zyabin101 supercollider.github.io \$\endgroup\$ – a spaghetto Jan 11 '16 at 15:53
  • \$\begingroup\$ It's not an esolang. \$\endgroup\$ – a spaghetto Jan 11 '16 at 15:53
1
\$\begingroup\$

DStack, 21 bytes

@0
Hello, World!
@
ad
\$\endgroup\$
1
\$\begingroup\$

ShapeScript, 15 bytes

'Hello, World!'

I created ShapeScript for this competition. The interpreter on GitHub has a slightly modified syntax and better I/O (none of which are required in this answer).

Try it online!

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

Brainfuck, 177 bytes

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

And, just for fun, an ascii version:

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

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

Yeah, near the end I kinda slouched off and stopped trying to save characters..

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

Stackstack, 21 bytes

"Hello, World!" print

print is the standard output mechanism.

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

𝔼𝕊𝕄𝕚𝕟, 19 17 bytes

ô`Hello, World!`

The “” string construction actually ends up using more bytes.

\$\endgroup\$
  • 1
    \$\begingroup\$ Yay, someone else is using my language! You can do ô`Hello, world` too. \$\endgroup\$ – Mama Fun Roll Nov 2 '15 at 0:08
1
\$\begingroup\$

Aeolbonn, 14 bytes

:Hello, World!

: is the standard output mechanism.

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

ABCD, 390 bytes

AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAADDAAADBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBDBBBBBBBBBBBBDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAAAAAAAAAAAAAAAAAAADAAADBBBBBBDBBBBBBBBDBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBDBBBBBBBBBBBBBBBBBBBBBBBD

Equivalent to +++++etc+++.+++++etc+++.+++++++..+++.-----etc in brainfuck.

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

Dogless, 13 bytes

Hello, World!

There is no |, so the program just terminates and outputs itself.

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

BrainfuckXT, 16 bytes

{Hello, World!}$

{...} puts a string on the tape, and $ outputs it.

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

Thue, 24 bytes

a::=~Hello, World!
::=
a

When a is encountered in the last line, the string is printed.

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

Amiga E, 38 bytes

PROC main() IS WriteF('Hello, World!')

WriteF is the standard output mechanism.

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

A:;, 19 bytes

b:Hello, World!;p:b

Sets b to the string and prints it.

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

Kipple, 67 17 bytes

"Hello, World!">o

Sends the string to o using the preprocessor.

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

Version, 37 bytes

A:OUTPUT="Hello, World!"
B:IGNORE="*"

The first line prints the string. The second line tells the interpreter to ignore all lines, to prevent an infinite loop.

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

Augeas, 42 bytes

module A=let _=print_string"Hello, World!"

I'm writing this because ℝaphink won't.

\$\endgroup\$
  • \$\begingroup\$ If it got someone else to post an Augeas answer, I'm happy with that :-) \$\endgroup\$ – ℝaphink Oct 14 '15 at 5:08
1
\$\begingroup\$

Geom++, 17 bytes

" Hello, World! "

Yes, the spaces around the string are necessary.

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

Lines, 13 bytes

Hello, World!

There are no control characters, so the string is just output.

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

Gray Snail, 22 bytes

OUTPUT "Hello, World!"

OUTPUT just outputs the string.

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

PureStack, 18 bytes

"Hello, World!"
!~

Pushes "Hello, World!" to the stack and prints it.

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

Blank, 64 bytes

[33][100][108][114][111][87][32][44][111][108]{:}[101][72]{p}{@}

Hint: Read the interpreter / compiler to ensure that you use all features. This esolangs page, for example, used to exclude the p instruction.

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

EXCON, 137 bytes

<<<^<<<^!:^<<^<<<^<^!:<<^<^<<^<^!!:^<^<^<^<<^<^!:<<^<^<<^!:<<<<<^!:^<^<^<<^<<^!:^<^<^<^<<^<^!:<^<<<^<^<^!:<<^<^<<^<^!:<<^<<<^<^!:^<<<<<^!

Simple bit-hacking.

\$\endgroup\$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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