# “Hello, World!”

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.

## 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 COMMENT_FILTER = "!)Q2B_A2kjfAiU78X(md6BoYk";
var OVERRIDE_USER = 8478; // This should be the user ID of the challenge author.

/* App */

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

}

jQuery.ajax({
method: "get",
dataType: "jsonp",
crossDomain: true,
success: function (data) {
data.items.forEach(function(a) {
});
comment_page = 1;
}
});
}

jQuery.ajax({
method: "get",
dataType: "jsonp",
crossDomain: true,
success: function (data) {
data.items.forEach(function(c) {
if (c.owner.user_id === OVERRIDE_USER)
});
else process();
}
});
}

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

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

function process() {
var valid = [];

var body = a.body;
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],
});
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;

.replace("{{NAME}}", a.user)
.replace("{{LANGUAGE}}", a.language)
.replace("{{SIZE}}", a.size)

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)
language = jQuery(language);
jQuery("#languages").append(language);
}

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

width: 290px;
float: left;
}

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

font-weight: bold;
}

table td {
}
<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script>
<div id="language-list">
<h2>Shortest Solution by Language</h2>
<table class="language-list">
<tr><td>Language</td><td>User</td><td>Score</td></tr>
<tbody id="languages">

</tbody>
</table>
</div>
<tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr>

</tbody>
</table>
</div>
<table style="display: none">
</tbody>
</table>
<table style="display: none">
<tbody id="language-template">
</tbody>
</table>

• @isaacg No it doesn't. I think there would be some interesting languages where it's not obvious whether primality testing is possible. – Martin Ender Aug 28 '15 at 13:56
• If the same program, such as "Hello, World!", is the shortest in many different and unrelated languages, should it be posted separately? – aditsu quit because SE is EVIL Aug 28 '15 at 15:33
• @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. – Martin Ender Aug 28 '15 at 19:34
• @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. – Martin Ender Aug 29 '15 at 23:01
• @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. – user202729 May 20 '18 at 10:20

# Wren, 29 bytes

System.print("Hello, World!")


Try it online!

## Explanation

System.print(               ) // Output the following string:
"Hello, World!"  // "Hello, World!"


# 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

• Consider a TIO link using your own interpreter for now? like so – Value Ink Dec 27 '19 at 2:30
• @ValueInk Done. – pppery Dec 27 '19 at 2:31

# Visual Basic Script, 21 bytes

MsgBox"Hello, World!"


You can try it by making a .txt file with that text in it, changing the extension to .vbs and running it.

• Welcome to the site! As this is a very busy question, you should be aware that your answer may not be unique. However, it is just as valid either way. Would it be possible to edit in a link to an online testing site, such as Try it online! so that others can verify your answer? – caird coinheringaahing Aug 29 '19 at 14:50

## tq, 15 bytes

"Hello, World!"


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

## 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>  # ><>, 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 # Deadfish~, 1 byte w  Try it online! # evil, 70 bytes aeeeaeeewueuueweeueeuewwaaaweaaewaeaawueweeeaeeewaaawueeueweeaweeeueuw  Try it online! • Just in case you missed it, there is a shorter evil solution, posted by my pronoun is monicareinstate 2 months ago. – manatwork Jun 19 at 0:36 • @manatwork oh whoops. does that mean I should take this down? – AdamS Jun 19 at 12:37 • No, there is nothing against such solutions. Mentioned it more as fun fact. – manatwork Jun 19 at 15:51 • Actually I also missed the relevant one: grc posted this exact evil solution 4 years 6 months ago. ☹ – manatwork Jun 21 at 2:47 # C++, 59 bytes #include <iostream> int main(){std::cout<<"Hello, World!";}  • Isn't the newline optional? – jrich Aug 28 '15 at 14:14 • @UndefinedFunction try it. It will not work without a new line – galexite Aug 28 '15 at 17:36 • Isn't printf smaller? #include <cstdio>? – galexite Aug 28 '15 at 17:37 • @georgeunix My comment referred to a previous version, in which it read cout<<"Hello, World!\n". The \n was removed, since a newline was not required after the output. – jrich Aug 28 '15 at 17:39 • Oh OK, sorry for that @UndefinedFunction – galexite Aug 28 '15 at 17:39 # Stackstack, 20 Bytes This is a stack-based language not focused on golfing! Looks similar to Forth, and was made two years ago. "Hello, World!"print  ## STATA, 17 bytes di"Hello, World!"  # Algoid, 28 bytes text.output("Hello, World!")  Now that's just boring in such a fun language... Here's a slightly longer version, let's get some colours going for 104 bytes: algo.hide() algo.setColor(algo.color.GREEN) algo.setBgColor(algo.color.DARK_RED) algo.text("Hello, World!")  See the output here Okay I've finished for the day now :) # Enema, 21 bytes "!dlroW ,olleH"[DZBO]  ### How it works "!dlroW ,olleH" Push those characters (including a null byte) on the stack. [ Infinite loop: D Duplicate the topmost element on the stack. Z If it is non-zero, skip the next instruction. B Break out of the loop. O Output as a character. ]  # dc, 16 bytes [Hello, World!]p  I can't think of any way to get this one shorter. # Element, 17 bytes Hello\,\ World\!  The  outputs the string, while the \s are used to escape out of other characters. # FALSE, 15 bytes "Hello, World!"  # Io, 21 bytes "Hello, World!" write  • This Io (TIO) seems to have print, but not write. Is this another language with the same name? – Dennis Feb 11 '18 at 15:40 • @Dennis It appears to have write, but it appears to write to some mysterious location/file/somewhere else instead of STDOUT – ASCII-only Apr 13 '18 at 8:35 # Objective-C, 30 bytes main(){puts("Hello, World!");}  # Ada (GNAT), 54 bytes procedure gnat.io.a is begin put("Hello, World!");end;  This trick is from anarchy golf: by defining your program in the GNAT.IO namespace, you have access to the put function, which is shorter than the usual way to print strings. # Curry, 26 bytes main=putStr"Hello, World!"  # Clojure, 22 bytes (print"Hello, World!")  # K, 18 bytes 0:"Hello, World!"  • I think you should try for every letter in the alphabet ;) – Beta Decay Aug 28 '15 at 18:22 • In some versions of K, you can just use "Hello, World!" as the entire program. I can't recall, but I believe it's either official K2 (NOT Kona, which doesn't print it; I think it's a K3 thing) or the official K5 (not sure about oK, though). – kirbyfan64sos Sep 2 '15 at 2:28 # Frink, 23 bytes println["Hello, World"]  I only know of this through my searches for programming apps in the Play Store. # Betterave, 16 bytes $"Hello, World!"


Betterave is unusual in that it has the whole "one character = one command" thing going on that many esolangs have, but it uses prefix notation, and the program is one big expression à la Scheme, as opposed to being tape- or stack-based. Here, \$"Hello, World!" is just like a function call to print.

# TvmJIT, 29 bytes

(!call print "Hello, World!")


# awk, 25 bytes

END{print"Hello, World!"}

• I know little of awk, but I think you can remove the END part. (It's June I know). – Erik the Outgolfer Jun 2 '16 at 19:30
• Actually, if you use END, it requires some kind of input... the input can be empty but it seems to be needed on my version of AWK. You do need a label, though, otherwise nothing will happen. BEGIN works, but it adds 2 bytes. :( – Robert Benson Jul 19 '16 at 13:11
• You're both right(ish). If you can invoke the one blank line of input rule you don't need the END, otherwise you must use BEGIN not END. – user3710044 Mar 19 '17 at 8:53

# REBOL, 26 bytes

REBOL[]prin"Hello, World!"


REBOL scripts needs a valid header; the first seven bytes of this program are the simplest possible header. Then, prin prints a value without a trailing newline.

# Dart, 31 bytes

main(){print("Hello, World!");}


# Gema, 21 bytes

\A=Hello, World\!@end


(Without input it would wait forever without terminating. Hence the need for explicitly @end.)

# Inform 6, 24 bytes

[Main;"Hello, World!";];
`

This must be compiled to Z-code, not Glulx.

Inform 6 has the neat feature that bare string literals are compiled into a print statement followed by a return true statement.