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

## Mascarpone, 29 bytes

[!dlroW ,olleH]$.............  The esolangs page notes that from a typical programmer's point of view, it is not obvious how to program in it In fact, although the language's designer believes it to be Turing complete, and I personally respect his expertise in esoteric languages enough to take it on trust that it's at the very least a non-trivial language, I haven't figured out how to write a loop. So what this does is to push the characters [!dlroW ,olleH] onto the stack (the [] delimiters are necessary, and do for some reason end up on the stack too), pop the ] with $, and then print everything except the [, one character at a time.

• I know this is way late, but you can loop by having an operation call itself [!dlroW ,olleH]$[/.:!]v*:! – BlackCap Jul 21 '17 at 14:57 # Shtriped, 199 bytes e n e b i b + x y + i x d y + + d x 0 + b b b 1 + b n n 0 A 1 0 B 0 1 1 1 1 A 0 0 B 1 1 A 0 A 0 0 B 1 A 0 B A 0 B 1 A A A 0 0 B A A 1 A B A A 1 1 1 A A B 1 A B 1 A A 1 A A A 1 A B s n  (Tested in v1.0.0. Does not output trailing newline.) Shtriped has no strings, only non-negative arbitrary precision integers. But you can print strings by encoding them as integers. The integer that encodes Hello, World is 46758282851806618588827407. Every two digits essentially encodes one character in offset ASCII order, 82 is l, 85 is o, etc. The program basically declares the variable n to 0, and increments it one by one until it is 46758282851806618588827407, then prints it as a string. (In Shtriped, any integer larger than 0 needs to be incremented one by one to get there.) Incrementing that high is obviously impossible in any reasonable amount of time, (a 3Ghz processor could maybe do it in 500 million years) so don't run this program, you will never see it finish! However, I am certain that it would finish, it if had the time. It should never run out of memory or have a stack overflow thanks to tail recursion optimization. To explain what's really happening, here's a nearly identical program that will finish in a few seconds, outputting Hel. Everything is the same except the large column of 01AB's above the last line. e n \ declare n to 0, this is the variable that will be incremented to that huge number e b \ declare b to 0, this is the binary place value that will keep getting doubled i b \ increment b, making it 1 + x y \ define a function called "+" that returns x + y + \ define a nested function also called "+" i x \ increment x d y \ decrement y unless y is 0, in that case return the last statement's value + \ recursively call self + \ call nested "+" d x \ decrement (and return) x, since we will have over counted by 1 0 \ define a function called "0" that adds b to itself, doubling it + b b b 1 \ define a function called "1" that adds b to n, then calls 0 + b n n 0 \ at this point we could set n to be any number by calling 0 and 1 \ according to the desired number's reversed binary representation \ but these A and B helper functions help golf that part A \ calls 1 then 0 1 0 B \ calls 0 then 1 0 1 \ call functions 0 1 A B to increment n to the desired number B 1 1 1 1 A 0 A 0 0 A B 1 1 \ expanding the B's and A's, this becomes 0111111001000100111 \ which reverses to 1110010001001111110 in binary \ which is 467582 in decimal \ which is the encoding of the string "Hel" s n \ finally, print n as a string  Note that I'm very doubtful this answer is optimal for Shtriped. Printing each character of Hello, World! or some combinations of its substrings could be much shorter, but doing that would require lots of trial and error and mathematical calisthenics (or at least a better golfer). For now, I like this elegant, if suboptimal solution. # Brain-Flak, 180, 176, 170 + 3 = 173 bytes ((()()())((((((((({})){}{}){}){}){})(((()()()){}()){}){}())([])[]{})))((((([][]()){}){})[[][]])<>)<>((((((({}))[]{}[][]())[][][])()()())[[]]()()()())[[]]()()())(<>{}()<>)  Try it online! This code is 170 bytes long, but adds three bytes for the -A flag, which is required to force brain-flak to input and output in ASCII. One little detail is that this also requires the -r flag, but it did not when I first wrote this answer, so I am not adding one byte for it. I'd post a detailed explanation, but this language hurts my brain... Thanks to @Wheatwizard for saving 4 10 bytes! Crossed out 4 is still regular 4... :( • You can save two bytes by moving the last 3 in the first push portion to the beginning and popping it for the first 3. (Since that is probably confusing here is a try it online) – Ad Hoc Garf Hunter Sep 6 '16 at 17:49 • You can also change ([]){} to [][]. (try it online) – Ad Hoc Garf Hunter Sep 6 '16 at 17:51 • @WheatWizard Good tips, thankyou! – James Sep 6 '16 at 17:53 • You can change (({})){}([])[](){} to (({}))[]{}[][](). (try it online) – Ad Hoc Garf Hunter Sep 6 '16 at 18:11 • Ok, two more: try it online – Ad Hoc Garf Hunter Sep 6 '16 at 18:19 # V, 14 bytes iHello, World!  Try it online! This enters insert mode, then inserts Hello, World! into the field. # Parenthetic, 766698 630 bytes ((()()())(()())((()())((()()())(()()()()))((()(())(())())((()(()))((()()(()))(()()())((())()()()()()()()()()()()()()))((()()(()))((())()()()()()())((())()()()()()))(()()()())))))((()(()))((()())((())()()())((())()()()))((()())((())()()()()())((())()()()()()()))((()())((())()()()()()())((())))((()())((())()()()()()())((())))((()())((())()()()()()())((())()()()))((()())((())())((())()))((()())((()))((())()()))((()())((())()()()())((())()()()()()))((()())((())()()()()()())((())()()()))((()())((())()()()()()())((())()()()()()()))((()())((())()()()()()())((())))((()())((())()()()()())((())()()()()()))((()())((()))((())()()())))  Try it online! Still got a lot to golf. This version uses a single definition (define f (lambda (a b) (char (+ (* a 13) 30 b))))  In other words, each char is encoded by two numbers a and b, for which 30 + 13*a + b is calculated (e.g. H = 73 = 30 + 3*13 + 3) . • nice work ... I thought it could be done better – MickyT Sep 4 '15 at 1:01 • 608 bytes using (define f (lambda (a b) (char (- (* 6 19) (* a 13) b)))) – Leaky Nun Aug 23 '17 at 11:00 • 604 bytes after golfing Leaky Nun's answer slightly – Sherlock9 Aug 23 '17 at 13:07 # Casio Basic, 15 Bytes "Hello, World!"  I think it explaines itself well enough... • Hello, and welcome to PPCG! This is a good answer; the downvote was an automatic Community downvote (AFAIK), and I cancelled it with an upvote. – NoOneIsHere May 30 '17 at 20:16 • Thanks and sorry that I messed up the formatting, I'm not really used to yet... – ADDB May 30 '17 at 20:17 • Perfectly OK! Just use four spaces before code, and a pound sign (#) or two before your header. – NoOneIsHere May 30 '17 at 20:18 # Sad-Flak, 199+3 bytes = 202 bytes 3 bytes for the -A arg. This lang uses a "codepage", where ≤≥ are one byte each (that is, I have a thing that replaces  and ~ with those chars and runs it) 32 ({}≤()≥) (≤()≥) 99 ({}≤()≥) ((<>[≤()≥])) 7 ({}≤()≥) ((<>))≤()≥ 5 ({}≤()≥) (≤()≥) 109 ({}≤()≥) (<>)(≤()≥) 85 ({}≤()≥) (≤()≥) 30 ({}≤()≥) (≤()≥) 42 ({}≤()≥) ({≤()≥})(({()}))({()})(()) 70 ({}≤()≥) ≤≥  Try it online! ## Explanation: The main idea behind this is that the way Sad-Flak works, you can easily get it to repeat a line a constant number of times. in Sad-Flak, there is a line pointer. The line pointer starts at the beginning -> 32 ({}≤()≥) (≤()≥) 99 ({}≤()≥) ((<>[≤()≥])) 7 ({}≤()≥) ((<>))≤()≥ 5 ({}≤()≥) (≤()≥) 109 ({}≤()≥) (<>)(≤()≥) 85 ({}≤()≥) (≤()≥) 30 ({}≤()≥) (≤()≥) 42 ({}≤()≥) ({≤()≥})(({()}))({()})(()) 70 ({}≤()≥) ≤≥  however, the 32 is not actually a command. it is a simple way to express 32 blank lines. I could expand them for the demonstration, but then it would be unreadable. anyway. So, the line pointer points at the first of 32 blank lines. When the line pointer points at a non-blank line, it will execute that line. when the line pointer points at a blank line, it will execute the first non-blank line after that line. that means we execute ({}≤()≥). What does this line do? This lang is a brainflak derivative, btw, so some of the brackets do the same thing, but not all ( push... {} pop off the main stack and evaluate to that value, plus ≤ jump by the amount inside, evaluate to that value for the purpose of other commands () 1 ≥ )  so, this pops off the stack, adds one to it while jumping one forward, then pushes back on the stack. What is jumping? why are we jumping in the middle of a line? Jumping in Sad-Flak is rather different to most other langs. Jumping does not take immediate effect, but rather moves the line pointer. when the line pointer is moved, nothing happens until the current line is finished executing. when it is finished, we see which line the line pointer points at, and execute that. If the line pointer didn't get moved, the same line gets executed again, and again, until it gets moved. however, all lines in this program either are blank, or they jump or halt. So, this line moves the line pointer one forward and increments top of stack. What is the line pointer pointing at now? it's still on a blank line, so it does the same thing again, and again, until it gets to the line that it keeps executing  32 -> ({}≤()≥) (≤()≥) 99 ({}≤()≥) ((<>[≤()≥])) 7 ({}≤()≥) ((<>))≤()≥ 5 ({}≤()≥) (≤()≥) 109 ({}≤()≥) (<>)(≤()≥) 85 ({}≤()≥) (≤()≥) 30 ({}≤()≥) (≤()≥) 42 ({}≤()≥) ({≤()≥})(({()}))({()})(()) 70 ({}≤()≥) ≤≥  Then, it executes it one last time, before moving to the next line. this end up with the charcode of ! on the stack (32 blanks + 1 actual line)  32 ({}≤()≥) -> (≤()≥) 99 ({}≤()≥) ((<>[≤()≥])) 7 ({}≤()≥) ((<>))≤()≥ 5 ({}≤()≥) (≤()≥) 109 ({}≤()≥) (<>)(≤()≥) 85 ({}≤()≥) (≤()≥) 30 ({}≤()≥) (≤()≥) 42 ({}≤()≥) ({≤()≥})(({()}))({()})(()) 70 ({}≤()≥) ≤≥  this line ((≤()≥)) pushes a new 1 to the stack, and moves the line pointer one forward, onto a new blank line, to do basically the same thing as it did before. however it puts charcode of e. and also the next line is this: ((<>[≤()≥])). What is this complex line? well: (( push twice... <> value popped from stack, and pushed onto the offstack for later retrieval [ minus ... ≤ (jump but eval to the argument still) () 1 ≥ ] ))  so, this pops the e off the stack, and replaces it with two ds, while leaving an e on the off stack for later retrieval, and also jumping the line pointer to the next line. we have two, because one will be changed into l, because it saves bytes from pushing a 1 and incrementing it up to the next letter. we don't do this for all of them because it also cost bytes popping and pushing back onto the stack, as well as fitting the jump in there. from now on, I'm skipping the blank lines and the increment top of stack lines, because this explanation is long enough already. after adding 8 to yield l (( push twice... <> a value popped from stack, also pushed to offstack )) ≤ jump ... () 1 ≥  add 6 to yield r: this one again: (≤()≥) new value at 111 (o): ( push... <> popped value, also pushed to offstack. ) ( push... ≤ (jump and eval to same as...) () 1 ≥ )  so this pushes to the off stack while keeping it on the stack, and pushing another 1 on the stack. new 87 (W): this again: (≤()≥) new 32 (space): same again: (≤()≥) new 44 (,): ({≤()≥})(({()}))({()})(()) woah, what is that? put simply, it is just pushing onto the main stack what we pushed on to the offstack, then a 1 to make into a H: ( push... { pop from the off stack, evaluate to that multiplied by... ≤ jump and eval to... () 1 ≥ } ) this pushes o (( push twice... { multiply an offstack popped value by... () 1 } )) this pushes l twice ( push... { offstack popped value times... () 1 } ) this pushes e ( push... () 1 )  new 72 (H): ≤≥: this is the halt command and it stops the program That pushed !dlroW ,olleH char codes, which then gets printed, but backwards because it is a stack. "Hello, World!" # Cubically, 12412311199 78 bytes -11 bytes thanks to TehPers, -12 thanks to language updates, -21 thanks to user202729 RU+432@6+50-4@6+3-4@6@6+1-00@6-331@6-00@6+4110@6+0000@6+1-00@6-0@6-2+4@6-331@6  Generated via this amazing algorithm. There is a good explanation of Cubically in this question. Cubically, the Rubik's Cube Programming Language, is the most complex language I have ever written, or dealt with, for that matter. It entirely comprises of operations on a single 3x3 Rubik's Cube in its memory, and one extra value, the "notepad". The only way to perform mathematical operations is to take values from a certain cube face and add/subtract/multiply/divide it with the scratch pad value, replacing said value. For example, performing /0 divides the notepad value by the sum of all integers on the 0-indexed face, or the first face. The cube starts out initialized like this:  000 000 000 111222333444 111222333444 111222333444 555 555 555  Performing a 90-degree clockwise turn on the right face will make the cube look like this:  002 002 002 111225333044 111225333044 111225333044 554 554 554  Version from TehPers: Here's a run-down of how the program works: (Note that I have replaced @6 with @ in the code, but changing each instance in the rest of this answer would be too tedious and I need to get back to real life.) • +53 adds the DOWN face and RIGHT faces into the notepad, in this case, 45 and then 27. This results in 72, the ASCII code for H. • @6 prints the notepad value as ASCII. • :2 sets the notepad to the value of the FRONT face (18). • /1 divides the notepad by the LEFT face (9), resulting in 2. • +551 Adds the DOWN face (45) twice, then the LEFT face (9). As you can see, without rotating the cube, the faces will contain a total value equal to 9 times the index. For example, face index 5 has a value of 45, face index 1 has a value of 9, and so forth. After rotating the cube, this no longer applies. • @6 again prints the notepad value, or e. • :5 sets the notepad to the value of the DOWN face (45). • +52 adds the DOWN face (45) and the FRONT face (18) to the notepad. • @66 prints the current notepad value as a character twice. At this point Hell has been printed, which should be good enough for this language. :P • :3/1 sets the notepad to the value of the RIGHT face (27), then divides the notepad by the value of the LEFT face (9), resulting in 3. Do you see the pattern yet? • +552 adds 108 to the notepad, or 9*(5+5+2). Remember, if you rotate the cube, then the faces will not necessarily be multiples of 9! • @6 prints the notepad value as a character, finishing the word "Hello". • From this point there is nothing interesting. The program follows the pattern of setting the notepad value to whatever c % 9 is (where c is the target character), then adding multiples of 9 to the notepad get to the target character. The faces are not rotated, so this isn't exactly the best showcase program for Cubically, but it's certainly simpler than what could be accomplished with rotating the faces. There may be a shorter way to write this program using rotations, though. Original (written by hand >.<) +53@6+1F2L2+0@6L2F2U3R3F1L1+2@66L3F3R1U1B3+0@6:4U1R1+00@6-000@6+50000@6+000000@6+2-000000@6-5+4000@6-00@6/0+00@6:0+0/0+00@6  The above Hello World program uses arbitrary turns that I fiddled with until they got some desired values. Eventually, I got the top face to add up to 4 and made do with that. Here's a run-down of how the program works: • +5+3 adds the DOWN face and RIGHT faces into the notepad, in this case, 45 and then 27. This results in 72, the ASCII code for H. • @6 prints the notepad value as ASCII. • +1 adds the LEFT face to the notepad value, resulting in 81. • F2 turns the FRONT face to look like this. • L2 turns the LEFT face to look like this. • +0 adds the UP face to the notepad, resulting in 101. • @6 prints memory as ASCII e. • L2F2U3R3F1L1 turns the cube to look like this. • +2 adds the FRONT face to the notepad, resulting in 108. @66 prints as ASCII twice ll. At this point Hell has been printed, which should be good enough for this language. :P • L3F3R1U1B3 turns the cube to look like this. • +0 adds the UP face to the notepad (resulting in 111), @6 prints it as ASCII o. • :4 sets the notepad to the BACK face 36. • U1R1 turns the cube to look like this. The cube is not turned again 'cause this was about as good of a setup I could get. • +0+0 adds the UP face to the notepad twice, resulting in 44. • @6 prints as ASCII ,. • -000 subtracts 12 from the notepad (32). @6 prints as ASCII . • From this point there is nothing interesting except messing with the existing faces, particularly the top face (which has a convenient value 4), to print the remaining characters. • It's not complex, just insanely difficult :o – HyperNeutrino Jun 15 '17 at 0:45 • @HyperNeutrino It's rather complex. Wait for the explanation :P – MD XF Jun 15 '17 at 0:46 • you should change the title on this – Destructible Lemon Jun 15 '17 at 1:32 • Also that is not postfix – Destructible Lemon Jun 15 '17 at 1:32 • @DestructibleLemon oh duh – MD XF Jun 15 '17 at 1:38 # Lua , 22 20 bytes print"Hello, World!"  Try it online! Thanks to @mathmandan for saving 2 bytes • I don't think you need the parentheses, so you can save two bytes: repl.it/BEPR – mathmandan Aug 28 '15 at 15:22 • How about ="Hello, World!" – because technically this does output "Hello, World!". – ascx Sep 7 '15 at 16:26 • @Socialz I just relized(thanks to you) that the = is not even necessary. – jakebacker44 Sep 7 '15 at 16:29 • @JakeBacker I can't reproduce that though, heh, which version are you running? – ascx Sep 7 '15 at 16:30 • @Socialz repl.it/BGIS – jakebacker44 Sep 7 '15 at 16:31 # Pepe, 122 120 bytes Pepe is my brand new programming language, which is horrible. reeEeeEeeereeEEeeEeErEeEEeEEeereeereeeREeEEeEEEEReeereeeEeEEeereeeEeeeeereeEeEeEEEReeereeEEEeeEereeereeEEeeEeereeeEeeeeE  Try it online! There might be shorter solutions, but that's not task for my brain .-. That's why I'd offer a 50 100 bounty to anyone who can make it shorter, if it's possible. I don't really believe it is, but maybe you can change my mind? This solution is quite simple, but better to explain it ungolfed and commented: reeEeeEeee # H > print H reeEEeeEeE # e > print e rEeEEeEEee # l > push l to r reee reee # print it twice REeEEeEEEE # o > push o to R Reee # print it reeeEeEEee # , > print , reeeEeeeee # > print a space reeEeEeEEE # W > print W Reee # o > print active value in R (o) reeEEEeeEe # r > print r reee # l > print active value in r (l) reeEEeeEee # d > print d reeeEeeeeE # ! > print !  The first line prints Hello, and a space, the second prints World!. Most of this program are character functions, ex. reeEeeEeee which prints H. By letter: • r - Stack r • e - Print • eEeeEeee - 01001000 (72), the ASCII character for H As said, most of the program consists of similar commands, but, to golf it a bit, in first occurrence of l, I replaced the first e with E, so instead of printing, it pushed the charcode to the stack. Thanks to this, we can later print l using reee, the command for printing. Edit: Now, I've done the same with o, thanks to the existence of the second stack (notice the R letter). # Self-modifying Brainfuck, 28 19 bytes ␀ represents a literal NUL byte. <[.<]␀!dlroW ,olleH  Try it online This is my Python interpreter that is referenced on the Esolangs page for SMBF. The default/example program is the program above. The SMBF code is entered on line 178 so that the Input box can be used for STDIN. If input is not empty, it would need to be this (20 bytes): <[.+<]␀!dlroW ,olleH  Since SMBF has its own source code on the same tape, we put the string on the tape in reverse to facilitate printing. Then we print all the cells from right to left up to the cell with zero in it (the cell represented by ␀). After printing, I have to change the comma to a different character so it doesn't look for input. Using + changes it to a - and vice versa, so either way it's a no-op (not that it matters, since printing is done anyway). • The second version could be just <[.+<]\x00!dlroW ,olleH, couldn't it? – primo Jul 27 '16 at 12:55 • @primo Yeah, it could. – mbomb007 Jul 28 '16 at 14:16 • Doesn't the second version work even with input? Sure, it'll read a byte of input, but the program does the same thing regardless of whether any byte or EOF is read. – user62131 May 1 '17 at 1:13 • Taking input when you're not supposed to isn't allowed. That's what the 2nd program is assuming. – mbomb007 May 1 '17 at 14:29 # Backhand, 15 bytes "ol!,ld elWHro"  Now on Try It Online thanks to Dennis! Backhand is my first new language, taking inspiration from 2D languages like Befunge and ><>. However, it is 1D, but makes up for the missing dimension by having the pointer move more than one character at a time. Initially, the program starts at location 0 with step count 3. " ! d l r " starts a string literal and starts pushing characters to the stack o , W o Change direction and go left when you reach the end l l e H " Switch direction again to go right and end the string literal H Halt and output stack  Of course, it looks quite funny, since the program is also an anagram of just "Hello, World!". # Symbolic Python, 175 157 147 136 bytes _=-~(_==_) _*=_-~_ __=_*_+~-~-_ _=('%'+' '[~_/_])*-~-~_%(~-_*~-~-_,_*_+_/_,__,__,_*_-~_,',',' ',__-_+~_,_*_-~_,_==_[_/_],__,_*_)+'!'  Try it online! I'm not sure this is optimal, but it sure was fun. ### Explanation: _=-~(_==_) # Set _ to 2 _*=_-~_ # Set _ to 2*(2+2+1) = 10 __=_*_+~-~-_ # Set __ to 10*10+(10-1-1) = 108 _= # Set _ to ('%'+''[~_/_]) # %c, where c is coming from the character \x0c *-~-~_ # Repeated 12 times %(... # Then format into that format string ~-_*~-~-_, # (10-1)*(10-1-1) = 72 = 'H' _*_+_/_, # 10*10+1 = 101 = 'e' __, # 108 = 'l' __, # 108 = 'l' _*_-~_, # 10*10+10+1 = 111 = 'o' ',', # ',' ' ', # ' ' __-_+~_, # 108-10-(10+1) = 87 = 'W' _*_-~_, # 10*10+10+1 = 111 = 'o' _==_[_/_], # second letter of True = 'r' __, # 108 = 'l' _*_ # 10*10 = 100 = 'd' )+'!' # Then add the last char '!' # And implicitly print _  # AArch64 machine language Linux, 48 45 bytes  0: d2800020 mov x0, #0x1 ; stdout is fd=1 4: d28001a2 mov x2, #0xd ; length of string 8: 94000001 bl c ; put addr of pc to x30 c: 910053c1 add x1, x30, #0x14 ; put addr of string to x1 10: d2800808 mov x8, #0x40 ; select write() syscall 14: d4000001 svc #0x0 ; syscall 18: d2800bc8 mov x8, #0x5e ; select exit() syscall 1c: d4000001 svc #0x0 ; syscall 20: 6c6c6548 "Hello, World!" 77202c6f 646c726f 21  To try it out on an AArch64 Linux machine or Android device with Termux, compile and run the following C program. You may need to pass the -zexecstack argument to the compiler. const char main[]=" \0\x80\xd2\xa2\1\x80\xd2\1\0\0\x94\xc1\x53\0\x91\b\b\x80\xd2\1\0\0\xd4\xc8\v\x80\xd2\1\0\0\xd4Hello, World!"  # Brainetry, 651 bytes This is a boring golf of the program that comes after this one. a b c d a b c d e f g h a b c d e a b c d e a b a b c d e a b c d e f g h a b a b a b c d a b a b c d e a b c d e a b c d e a b c d e a b c d e a b c a b c a b c d e f g h i a b c a b c d e a b c d e a b c a b c d e a b c d e a b c d e a b c d e f g h i a b a b c d e a b c d e f g a b a b a b a b c d a b c d e f g a b a b a b c d e f g a b c d e f g a b c d a b c d a b c d a b c d e f g h a b c d e f g a b a b c d e f g h i a b c a b c a b c a b c a b c d e f g a b c d a b c d a b c d a b c d e f g a b c d e a b c d e a b c d e a b c d e a b c d e a b c d e a b c d e f g a b c a b c a b c d e a b c d e f g a b a b a b a b a b c d a b c d e f g  Ungolfed but far more interesting to read: This is a "short" brainetry program that outputs, to stdout, the message "Hello, World!" as per the programming world standard. This standard dictates that a user that is trying a language for the first time should write as its first program this "Hello, World!" program. Of course, this becomes a repetitive task, this becomes a repetitive task, this becomes a repetitive task, this becomes a repetitive task, this becomes a repetitive task, but that shouldn't hinder you from tackling this awesome challenge in the Brainetry programming language. Me, myself and I have found this language to be quite amusing if used to write self-referential programs like this one. Self-referential objects are objects that I, personally, really enjoy. This might be because I am just a weird person. Or not! Who knows? Certainly not me. Dear reader, please rest assured that we are ALMOST at the MIDDLE of this self referential program. Also, please refraing from adding the hyphen between self and referential in the line above, as it is NOT a typo, it is missing purposefully. A very important skill needed to write Brainetry programs is one's imagination. This is because each instruction needs one line of Brainetry source code on its own. Sounds easy? I can assure you, it definitely is not easy. I'm growing tired, I'm growing unimaginative, I'm growing old, I'm writing code. Oh boy, I wish that would've rhymed! Even though I can't really rhyme in English because I am unskilled, I can tell you that this is exhibiting signs of schizophrenia, right? At this point I am pretty much talking to myself, and no one is listening, right? No one is listening, right? I definitely hope not. Now on to some decent source code, this program works by harnessing the well known power of modular arithmetic, a really nice thing mathematics has bestowed upon us, mortals. This is, for real, a really awesome gift from the mathematicians of yor to us.  Builds on top of this awesome brainfuck answer. • This feels like it isn't a serious contender, since the language only appears to care about the number of words in a line, and there are a lot of words with many more letters than necessary in them. – pppery Jun 10 at 22:53 • @pppery you are, of course, right. I golfed it and included both the golfed and verbose versions. The verbose version is MUCH funnier to read :) – RGS Jun 11 at 12:07 • I don't disagree, but I've chosen to focus my energy on objective rule enforcement over reading funny answers. – pppery Jun 12 at 1:37 • @pppery yes, thank you for your objectivity :) – RGS Jun 12 at 6:26 • @pppery I have just seen your profile again and I find the seemingly-new sentence "But I cannot be dissuaded -- I will keep on hunting for old invalid answers and close-voting questions like I've always done." even more worrying than everything I have ever seen there so far... – my pronoun is monicareinstate Jun 12 at 11:57 # Forth, 17 bytes .( Hello, World!)  • ." Hello World! is one byte shorter. – Lynn Aug 28 '15 at 20:27 • ." may only be used within a function declaration. ." : error(-14): use only during compilation – mbomb007 Aug 28 '15 at 20:47 • Why the space in .( Hello,? – Erik the Outgolfer Jun 16 '16 at 14:56 • @EʀɪᴋᴛʜᴇGᴏʟғᴇʀ Forth requires spaces between tokens. The ending ) is the exception to the rule. – mbomb007 Jun 16 '16 at 14:56 • @mbomb007 It's unfair that ." is only in functions. – Erik the Outgolfer Jun 16 '16 at 15:03 # Batch File, 19 Bytes @echo Hello, World!  Short and to the point. You'd think you could golf off the @ at the beginning, but if you do you get the literal program echo'd out before the string is printed. This is why you'll see @echo off at the beginning of near every .bat file around. Example without the @ C:\Tools\Scripts>.\hello-world.bat C:\Tools\Scripts>echo Hello, World! Hello, World!  • Isn't the language itself just called "Batch"? – mbomb007 Aug 28 '15 at 13:54 • @mbomb007 Kinda, sorta, maybe, not really. Batch files are just collections of lines that are executed by the associated command-line interpreter (usually COMMAND.COM but not necessarily, especially in newer Windows releases). It technically has some additional commands, like the infamous GOTO, but it's not in and of itself a language. – AdmBorkBork Aug 28 '15 at 14:11 • If you leave off the the echo you get an infinite amount of hello world!'s – User112638726 Aug 28 '15 at 14:21 • @User112638726 No, you should get something like 'Hello' is not recognized as an internal or external command, operable program or batch file. If you get something else, you must be using a different version of the interpreter than I am. – AdmBorkBork Aug 28 '15 at 14:28 • @MrPaulch if the filename is significant it has to be added to the byte coutn – undergroundmonorail Aug 30 '15 at 23:01 # J, 15 bytes 'Hello, World!'  No call to any write function needed. # Bash, 18 bytes echo Hello, World!  This works when invoked as a full program or with history expansion disabled (default for scripts). # Applescript, 15 bytes "Hello, World!"  Normally a fairly verbose language, for this one this is all that is required. • It's nice to see these verbose languages -- Applescript, PHP, PowerShell, etc. -- getting the better of lots of other languages for once. :) – AdmBorkBork Aug 28 '15 at 15:53 • @TimmyD That doesn't mean that they are good languages. It's just that they are better at some things. – galexite Aug 28 '15 at 16:53 • @georgeunix Oh, without a doubt. Every language has its pluses and minuses. There are plenty of things I'd change about PowerShell, but there's nothing else I'd rather use to script and config Exchange. Even if it had commands and functionality to do so, I don't think I could use Pyth or CJam or whatnot on a day-to-day basis instead. I was just meaning "It's nice to see non-golfing languages toward the top of the lowest-byte-count list for a change." – AdmBorkBork Aug 28 '15 at 17:06 • I understand @TimmyD – galexite Aug 28 '15 at 17:07 # Julia, 22 bytes print("Hello, World!")  Short and sweet. # D, 51 bytes import std.stdio;void main(){puts="Hello, World!";}  In D, a=b is sometimes equivalent to a(b), allowing us to shave off one more byte than you might expect. # Unlambda, 36 bytes .!.d.l.r.W. .,.lc.H.e.oi  Unlambda is a minimal functional programming language based on combinatory logic. It uses prefix notation; fx is an application of f to x. Specifically, .c is a primitive that takes some v, prints the character c as a side-effect, and returns v. Thus, the usual program would be to take i, apply .H to it, apply .e to it, etc., giving you .!.d.l... This 36-byte solution is due to irori on anarchy golf. It uses the primitive c, which I think is kind of like call/cc, to avoid having to write .o and .l twice. I have no idea how it precisely works. The sort-of equivalent Lisp syntax would be: (print-! (print-d (print-l (print-r ((print-W (print-space (print-comma ((print-l (call-cc (print-h print-e))) print-o)))) id)))))  # 4, 117 bytes 3.6000160103602136033260433605446067260787008070200908000120902111120111011015065095105105115055035075115125105085044  ### How it works Generating characters with a code point below 100 is straightforward. I've managed to create the others (derol) with three assignments and five additions/subtractions, which I believe is optimal. 3. Begin the program. 6 00 01 Set cell[ 0] to 1. 6 01 03 Set cell[ 1] to 3. 6 02 13 Set cell[ 2] to 13. 6 03 32 Set cell[ 3] to 32 = ' '. 6 04 33 Set cell[ 4] to 33 = '!'. 6 05 44 Set cell[ 5] to 44 = ','. 6 06 72 Set cell[ 6] to 72 = 'H'. 6 07 87 Set cell[ 7] to 87 = 'W'. 0 08 07 02 Set cell[ 8] to cell[ 7] + cell[2] = 87 + 13 = 100 = 'd'. 0 09 08 00 Set cell[ 9] to cell[ 8] + cell[0] = 100 + 1 = 101 = 'e'. 0 12 09 02 Set cell[12] to cell[ 9] + cell[2] = 101 + 13 = 114 = 'r'. 1 11 12 01 Set cell[11] to cell[12] - cell[1] = 114 - 3 = 111 = 'o'. 1 10 11 01 Set cell[10] to cell[11] + cell[1] = 111 - 3 = 108 = 'l'. 5 06 Print cell[ 6] = 'H'. 5 09 Print cell[ 9] = 'e'. 5 10 Print cell[10] = 'l'. 5 10 Print cell[10] = 'l'. 5 11 Print cell[11] = 'o'. 5 05 Print cell[ 5] = ','. 5 03 Print cell[ 3] = ' '. 5 07 Print cell[ 7] = 'W'. 5 11 Print cell[11] = 'o'. 5 12 Print cell[12] = 'r'. 5 10 Print cell[10] = 'l'. 5 08 Print cell[ 8] = 'd'. 5 04 Print cell[ 4] = '!'. 4 End the program.  # 123, 282 267 bytes 22221121121112112222222211211112111211211222222221121121133121121312121122222222111211213 31211213122222222111211332113312112222221112112331123322222221111211111211222221111211211 22222222112111112112112112222222111112112112112222213312112131222222221121113321133121121  The newlines are only for cosmetic purposes. I'm fairly sure that this is not optimal. Here is a slightly more readable (and also runnable) version: H 22221121121112112 e 2222222112111121112112112 l 22222221121121133121121312 l 12112 o 22222221112112133121121312 , 2222222111211332113312112 2222211121123311233 W 222222211112111112112 o 222211112112112 r 2222222112111112112112112 l 222222111112112112112 d 2222133121121312 ! 2222222112111332113312112 1  I started out by constructing an optimal linear code (i.e. one which doesn't use 3s which allow for loop). That is quite simple: for each character, determine which bytes to flip from the last one. Move to the right-most character that has to be flipped (with a series of 2s), then move back to the left with 1 for each byte that has to be flipped and 121 for each byte that shouldn't be flipped. Finally move to the writing index -2 and print the character with 21. Repeat. At the very end, move to index -1 with a trailing 1 in order for the program to terminate. This jumble of 1s and 2s was generated with this CJam script, which you can run online here: 0c"Hello, World!"+2ew::^{ _{2b8Ue[1a/W<1a*_,'2*'1@W%{'1"121"?}/"12"}{;"12112"}? }/ '1  Then I removed some repetition of ones and twos by inserting loops by hand. 3 works as follows: if the instruction pointer is to the left of index 0, skip the 3. Otherwise, jump to the previous 3 if the current bit is 1 or jump ahead to the next 3 if the bit is 0. So simple loops, repeating a code segment x can be constructed as 33x33 or 33x3 (depending on whether the termination condition is "current bit is zero" or "moved to a negative index"). Then I started enumerating some relevant simple loops and when they are applicable. I've been using these loops only when moving back through the bits to change one character code to the next. If we can use a loop here depends both on the current state of a bit a and the target state b. I'll be denoting this combined state of each position as [a b]. Now here are the relevant loops and the required position patterns in a regex-like syntax: 121: (^|[0 0]|[0 1]) ([1 1])+ [0 0] 112: (^|[1 1]) ([0 0])+ ([0 1]|[1 1]) 211: ([0 0]|[0 1]) ([1 1])+ [0 0] ([0 0]|[1 1]) 121121: ([0 0]|[0 1]) ([1 1] ([1 1]|[0 0]))+ [0 0]  Listing out the combined states for each character, we can annotate the potential loops and how many bytes they'll save (each ___ annotates the character above; sometimes multiple loops are possible): H [[0 0] [0 1] [0 0] [0 0] [0 1] [0 0] [0 0] [0 0]] e [[0 0] [1 1] [0 1] [0 0] [1 0] [0 1] [0 0] [0 1]] l [[0 0] [1 1] [1 1] [0 0] [0 1] [1 1] [0 0] [1 0]] __________________121 -2 ________________________121121 -3 l [[0 0] [1 1] [1 1] [0 0] [1 1] [1 1] [0 0] [0 0]] o [[0 0] [1 1] [1 1] [0 0] [1 1] [1 1] [0 1] [0 1]] __________________121 -2 __________________211 -2 ________________________121121 -3 , [[0 0] [1 0] [1 1] [0 0] [1 1] [1 1] [1 0] [1 0]] ________________________211 -2 [[0 0] [0 0] [1 1] [0 0] [1 0] [1 0] [0 0] [0 0]] ____________112 -2 W [[0 0] [0 1] [1 0] [0 1] [0 0] [0 1] [0 1] [0 1]] o [[0 0] [1 1] [0 1] [1 0] [0 1] [1 1] [1 1] [1 1]] r [[0 0] [1 1] [1 1] [0 1] [1 0] [1 0] [1 1] [1 0]] l [[0 0] [1 1] [1 1] [1 0] [0 1] [0 1] [1 0] [0 0]] d [[0 0] [1 1] [1 1] [0 0] [1 0] [1 1] [0 0] [0 0]] __________________121 -2 ________________________121121 -3 ! [[0 0] [1 0] [1 1] [0 0] [0 0] [1 0] [0 0] [0 1]] ________________________211 -2  Now I just picked the most profitable loop in each case and inserted it into the code. I'm fairly certain that one could find a couple more loops that I've overlooked. But I also think that it's possible to find a significantly shorter solution that isn't based on anything a human would come up with. So far I have no idea how to efficiently search for such a solution automatically though, so I'll leave it at that for now. # PowerShell, 15 Bytes Likely in Foo (among others) as well, but I'll let someone with more knowledge of those languages post. "Hello, World!"  or, alternatively, 'Hello, World!'  In PowerShell, both ' and " denote string literals. The difference is the double-quotes will expand variables (e.g., $myString) and escape characters (e.g., n), while the single-quote will treat everything literally.

PowerShell does an implicit Write of anything that's on a line by itself in a program (the relative merits of Write-Host vs Write-Output are left as an exercise to the reader) -- variable, literal string (as this is), result of a one-line command, etc. This stems from the fact that every line gets executed, and the way to execute a string is to print it. For other data types, if they have a way to convert to a string, the execution silently does the conversion in the background and then prints the resultant string. If there's no way to get a string, you'll wind up printing a description of the datatype. This is one of the ways that PowerShell, as ... verbose clear ... as it is, can wind up somewhat competing with other languages.

A short article on the topic, not written by me, though the author and I have a similar name.

# Prolog, 23 bytes

write('Hello, World!').

• What did you use to define a string if you didn't use "? – Beta Decay Aug 28 '15 at 12:57
• @BetaDecay Nothing, strings didn't exist as far as I know. So using " to create strings would create an array of character codes (ie ascii/unicode codes) representing the string. Character codes strings is created with backquotes in SWI-Prolog now. – Fatalize Aug 28 '15 at 13:01
• You can use single quotes to turn this into an atom, and thus make the program completely portable: write('Hello, World!'). More declaratively, I would simply define a a fact like: msg('Hello, World!').. Usage example: ?- msg(M)., succeeding with M = 'Hello, World!'.. – mat Sep 1 '15 at 12:18
• @mat Good suggestion that I use atoms instead of strings. For the msg('Hello, World!') though, I don't think it's valid in this challenge because it outputs M = 'Hello, World!'. instead of just Hello, World! (granted, it also outputs true after in my answer but I assume this is acceptable because Prolog really likes to output true or false :)) – Fatalize Sep 1 '15 at 12:25
• I know, the way this challenge is formulated kind of forces you to use impure langauge elements. Too bad! (BTW: The last sentence of your post is no longer applicable.) – mat Sep 1 '15 at 12:27

# goruby, 6 bytes

h:H,:W


Apart from the method_missing override, goruby also defines Kernel#h which accepts 3 parameters: the first letter of _ello (default H), the first letter of _orld (default w), and the final character (default !).

• Nice, I didn't know about the parameters it takes :) – Lynn Sep 3 '15 at 2:00

# NULL, 91 bytes

int("8bxyd2qvpj6uq6gh9u8hlrjfwqkx8i2pvid5auhrsrbpp8gsczv6ye26ew0pkx05wem94m9zqkn8prqir",36)


This number represents a program, and it has 126 digits in decimal representation. I use base-36 here to shorten the number. It seems acceptable because the interpreter of NULL uses the python eval on the program before executing it (presumably to allow specifying the program as a product of prime numbers). The prime factorization (used while executing the program) is

3*3*3*17*31*73*127*139*151*157*167*197*239*241*307*367*367*419*479*499*
547*599*619*677*751*839*919*947*947*1019*1039*1097*1129*1217*1249*1301*
1303*1327*1433*1499*1543*1613*1709*1777*1873*1951*1993*2063


I found this program by using something like A* search. It tracks the state of the NULL interpreter and two additional values:

• print - number of characters in the Hello, World! message it managed to output so far
• length - natural logarithm of the number that represents the program

For each state, it picks 10 possible commands the language has (there are 14, but the rest are too uncomfortable to search), and calculates 10 new states. To find the shortest program, it holds the states in a priority_queue, arranged by the following cost function:

print - length / 25


If I use a fudge factor much different from 25, it either keeps searching forever (until it eats all RAM) or finds sub-optimal solutions.

BTW there is a bug in the interpreter in the generation of prime numbers. I fixed it by simplifying the code this way:

def factor_g(include_builtin_list = True):
if include_builtin_list:
for x in plist: yield x
k = plist[-1] + 2
while True:
yield k
k += 2


# Turing Machine Code, 132 bytes

As usual, I'm using the table syntax defined here.

0 * H r q
q * e r w
w * l r e
e * l r r
r * o r t
t * , r y
y * _ r u
u * W r i
i * o r o
o * r r p
p * l r a
a * d r s
s * ! r halt


If the above link isn't working (sometimes it works for me, other times the page refuses to load) you may also test this using this java implementation.