# “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

# OCaml, 30 bytes

print_string "Hello, World!";;

• print_string"Hello, World!" also works, for 27 bytes. Try it online! – Dennis Jan 26 '18 at 1:11

# Hassium, 38 Bytes

Neat challenge! Love all the different submissions so far. Here is mine in a language I wrote called Hassium.

func main(){println("Hello, World!");}


Run it online here

• Using your online interpreter you can shorten it a bit using func main()println("Hello, World!") – MickyT Sep 19 '15 at 7:03

# tinyAll, 1 byte

Tinyall is a language that I've developed after this challenge was published.

It was written in a few hours, at 1AM.

The smallest valid example of an Hello, world! program was inspired by @Fatalize's answer. But it is too easy and only allows 1 syntax.

I've decided to do better:

f


This is the equivalent to Hf or H15. Low-case letters are considered numbers from 10 to 46(?).

H is the Hello, World! function, responsible for the output. Passing an argument, you can set specific bits to output a variation of the Hello, World! output.

You could also write like this:

Hf_


Or, with string expansion:

_"[:Hf]"


Or just plain:

_"Hello, World!"


And a dynamic example:

H:_


This one takes whatever input and outputs whatever version you decide it to. (By using :, the input has to be a number)

Execution example:

(function(window, undefined) {
var funcs = {
H:function(value) {
return 'hH'[value&1]
+'ello'
+(value&2?',':'')
+' '
+('wW'[+!!(value&4)])
+'orld'
+(value&8?'!':'')
+(value&16?'\n':'');
},
I:function(value, data){
return data.input;
},
'_':function(value, data){
var tmp = data.out + (value === undefined ? data.last : value);
data.vars[';'] = data.out = tmp;
return tmp;
},
V:function(value){
return get_value(value);
},
P:function(value){
return value;
}
};

var expand_string = function(value, data){

return value.replace(
/$:(?:([A-Z_])(.)?|([^A-Z_'"]))$/g,
function(_, func, arg, value){
if(func)
{
return funcs[func](get_value(arg, data, true), data);
}
else
{
return get_value(value, data, true)
}
}
);

};

var get_value = function(value, data, recursion) {

if(value === null || value === undefined || value === ' ')
{
return undefined;
}

var x = (value || '').toString();

if(/^\-?\d+$/.test(x)) { //returns a number return Function('return ' + x)(); } else if(/^[a-z]$/.test(x))
{
//returns a number between 10-43
return (x in data.vars) ? data.vars[x] : x.charCodeAt(0) - 87;
}
else if(x[0] == '\'')
{
return x[1];
}
else if(x[0] == '"' && x.length >= 2)
{
var sub = x.substr(1, x.length - 2);

return recursion ? sub : expand_string(sub, data);
}
else
{
return data.vars[x];
}
};

var noop = function(){};

window.tinyAll=function(code, input) {
var data = {
out: '',
last: 0,
input: input || 0,
vars: {
'|':'0.3',
':':input || 0,
';':0
}
};

if(!code || /^[a-z\d]$/.test(code)) { return funcs.H(get_value(code, {})); } code.toString().replace( // /(?:([^A-Z_:'"])=)?([A-Z_])(?::('.|"[^"]*"|-?\d+|.))?/g, /(?:([^A-Z_'"])=)?([A-Z_])(?:('.|"[^"]*"|-?\d+|[^A-Z_'"]))?/g, function(_, name, func, value){ data.vars[name || ':'] = data.last = (funcs[func] || noop)( value ? get_value(value, data) : data.last, data); return ''; } ); return data.out || 0; }; })(Function('return this')()); alert(tinyAll('_"\'Hf\' produces: \'[:Hf]\'"')); This is the original version. I'll post a new version of the code, as soon as I have time to publish on Github. # Sprects, 14 bytes .Hello, World!  # MUMPS, 17 bytes w "Hello, World!"  Not terribly exciting, but there you have it. # Windows Batch, 18 bytes echo Hello, World!  • We need to hide the prompt.... – stevefestl May 14 '17 at 11:53 ## UniBasic, 19 Bytes CRT 'Hello, World!'  # Processing, 23 bytes print("Hello, World!");  Well, that's pretty much it! # G*, 15 bytes p Hello, World!  Pretty simple. # Stringy, 17 bytes (Hello, World!);p  # Pip, 15 bytes "Hello, World!"  Straightforward. Any expression at the end of the program is auto-printed. • Out of curiosity, dose Pip have auto-closing end quotes? Or is that impractical for an infix language? – Conor O'Brien Sep 16 '16 at 1:23 • @ConorO'Brien It would certainly have been possible, I just decided I didn't like it for aesthetic reasons. – DLosc Sep 16 '16 at 3:06 • Fair enough. :D – Conor O'Brien Sep 16 '16 at 3:06 # 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.  # Chaîne, 13 bytes Hello, World!  Everything is an implicit string, and everything is implicit output. • Ooh, fancy i-like character~ Also an interesting language. – Addison Crump Nov 1 '15 at 18:12 # Microscript II, 15 bytes "Hello, World!"  # SuperCollider, 27 bytes "Hello, World!".post;1.exit  • Where is the documentation for SuperCollider? – user48538 Jan 11 '16 at 4:42 • @zyabin101 supercollider.github.io – a spaghetto Jan 11 '16 at 15:53 • It's not an esolang. – a spaghetto Jan 11 '16 at 15:53 ## DStack, 21 bytes @0 Hello, World! @ ad  # 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! # Brainfuck, 177 bytes ++++++++[>+++++++++<-]>.<[-]++++++[>+++++<-]>-.+++++++..+++.>>++++++++[>+++++<-]>++++.------------.+++++[>++++++++++<-]>+++++.--------.+++.------.--------.>>++++[>++++++++<-]>+.  And, just for fun, an ascii version: +++ +++ ++[>+++++ +++ +<- ]>.<[-]++ ++++[>+++ ++< -]>-.++++ +++ ..+ ++. >>+++++++ +[> +++ ++<-]>+++ +.------------.+++++[ >++++++++++<-]>+++++. --------.+++.------.- -------.>>++++[>+++++ +++<-]>+.  Yeah, near the end I kinda slouched off and stopped trying to save characters.. ## Stackstack, 21 bytes "Hello, World!" print  print is the standard output mechanism. ## 𝔼𝕊𝕄𝕚𝕟, 19 17 bytes ôHello, World!  The “” string construction actually ends up using more bytes. • Yay, someone else is using my language! You can do ôHello, world too. – Mama Fun Roll Nov 2 '15 at 0:08 ## Aeolbonn, 14 bytes :Hello, World!  : is the standard output mechanism. ## ABCD, 390 bytes AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAADDAAADBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBDBBBBBBBBBBBBDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAAAAAAAAAAAAAAAAAAADAAADBBBBBBDBBBBBBBBDBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBDBBBBBBBBBBBBBBBBBBBBBBBD  Equivalent to +++++etc+++.+++++etc+++.+++++++..+++.-----etc in brainfuck. ## Dogless, 13 bytes Hello, World!  There is no |, so the program just terminates and outputs itself. ## BrainfuckXT, 16 bytes {Hello, World!}$


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

## Thue, 24 bytes

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


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

## Amiga E, 38 bytes

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


WriteF is the standard output mechanism.

## A:;, 19 bytes

b:Hello, World!;p:b


Sets b to the string and prints it.

## Kipple, 67 17 bytes

"Hello, World!">o


Sends the string to o using the preprocessor.

## 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.

## Augeas, 42 bytes

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


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

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