# "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. Aug 28, 2015 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? Aug 28, 2015 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. Aug 28, 2015 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. Aug 29, 2015 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. May 20, 2018 at 10:20

# *><>, 21 bytes

"!dlrow ,olleH"Ool?u;


Try it out on the online interpreter here.

*><> (pronounced "Starfish") is an esolang based on ><>, developed by redstarcoder. Its aim is to add some useful features which are missing from base ><>, such as file IO, time functionality, and an interesting feature called 'dive/rise', which is used here.

If the 'dive' command, u is encountered, no instructions other than directional modifiers are executed until a 'rise' command, O, is encountered. Encountering a dive whilst already diving, or a rise when not diving, is treated as a no-op.

"!dlrow ,olleH"Ool?u;

"!dlrow ,olleH"         Push "Hello, world!" to the stack in reverse.
O        Rise - a no-op on first iteration
o       Output top of stack as ASCII character
l?u    If length of stack is non-zero, dive
;   End program execution

• I love ><> and been interested in *><> so using the dive command for a huge benefit which I haven't seen before is great :) Dec 19, 2016 at 14:47

# uBASIC, 21 bytes

1PRINT"Hello, World!"


uBASIC is the most basic BASIC.

Exits with an error (no trailing newline).

It took me until just now to realize I don't need a space between 1 and PRINT...

Try it online!

# T-SQL, 20 bytes

print'Hello, World!'


Try it online

# OIL, 15 bytes

Hello, World!
4


OIL is a self-modifying turing-machine-like programming language with random access, and weak typing. The first line does nothing, because it's not one of the integers currently defined as commands, so it is just skipped. The second line is a 4, the print command, which takes one argument (the next line) and prints the value at that location. Since the next line doesn't exist, it's uninitialized and defaults to 0, which causes OIL to print the contents of the 0th line, Hello, World!.

# Klein, 48 + 3 + 3 = 54 bytes

89*55+:*:(1+:7+:::(3+:(485*+48*699*+):3+))148*+@


Try it online!

# Klein, 50 + 6 = 56 bytes

+3 bytes due to the -A flag.

+3 bytes for 000 topology (though in my testing, pretty much all valid topoligies work)

89*45:**:(1+:7+::3+:(492+*84*9:*6+):3+6:3**)84*1+@


(Eligible for the bounty) Probably not optimal, but it's a start.

• You do have to add 3 for the topology you are using and 3 for the -A flag, (but so does everyone else, so it shouldn't hurt you) May 18, 2017 at 19:09
• @WheatWizard Yep, just added that in.
– Okx
May 18, 2017 at 19:11
• tio.run/##DcgxDoAgEATA78BuTA45EbbSx1gYjf/… May 18, 2017 at 22:59
• @WheatWizard It appears to work with an empty argument as well. tio.run/##DcgxEoAgEAPA70AyFsiJkEofY@Ho@P8usuU@73V/… May 19, 2017 at 0:58
• @Dennis Would that be +2 bytes then?
– Okx
May 19, 2017 at 6:15

# Memescript, 820 bytes

what the frick frack backtrack snick snack quarterback diddily dack diddily dack quarterback diddily dack diddily dack backtrack diddily dack backtrack diddily dack biofeedback quarterback diddily dack diddily dack quarterback quarterback diddily dack quarterback diddily dack diddily dack patty wack quarterback diddily dack slack mack frick frack thumbtack snick snack snick snack quarterback diddily dack patty wack sidetrack quarterback diddily dack snick snack patty wack patty wack biofeedback quarterback diddily dack diddily dack sidetrack diddily dack sidetrack quarterback diddily dack diddily dack patty wack quarterback diddily dack patty wack slack mack quarterback diddily dack patty wack crackerjack quarterback diddily dack slack mack frick frack thumbtack snick snack patty wack quarterback diddily dack


Explanation:

what the                     open program
frick frack backtrack        push 10
snick snack quarterback      multiply by 7 (70)
diddily dack diddily dack    add 2 (72)
quarterback diddily dack     print as char ('H')
diddily dack backtrack       add 10 (82)
diddily dack backtrack       add 10 (92)
diddily dack biofeedback     add 9 (101)
quarterback diddily dack     print as char ('e')
diddily dack quarterback     add 7 (108)
quarterback diddily dack     print as char ('l')
quarterback diddily dack     print as char ('l')
diddily dack patty wack      add 3 (111)
quarterback diddily dack     print as char ('o')
slack mack                   pop
frick frack thumbtack        push 11
snick snack snick snack      multiply by 4 (44)
quarterback diddily dack     print as char (',')
patty wack sidetrack         subtract 12 (32)
quarterback diddily dack     print as char (' ')
snick snack patty wack       multiply by 3 (96)
patty wack biofeedback       subtract 9 (87)
quarterback diddily dack     print as char ('W')
diddily dack sidetrack       add 12 (99)
diddily dack sidetrack       add 12 (111)
quarterback diddily dack     print as char ('o')
diddily dack patty wack      add 3 (114)
quarterback diddily dack     print as char ('r')
patty wack slack mack        subtract 6 (108)
quarterback diddily dack     print as char ('l')
patty wack crackerjack       subtract 8 (100)
quarterback diddily dack     print as char ('d')
slack mack                   pop
frick frack thumbtack        push 11
snick snack patty wack       multiply by 3 (33)
quarterback diddily dack     print as char ('!')


# Bubblegum, 11 bytes

0000000: 15 27 4d 50 62 a9 9a 29 6b 6d e2  .'MPb..)km.


Although technically Turing complete, Bubblegum was made for constant-output challenges.

Try it online!

# COBOL, 65 Bytes

PROGRAM-ID.H.PROCEDURE DIVISION.DISPLAY 'Hello, World!'.STOP RUN.


Just from what I remember. Probably doesn't work but I can't tell since my machines set up to run COBOL are long-gone.

• Welcome to the site! May 25, 2017 at 15:39
• This works just fine with GNU COBOL assuming you set the -F (or -free) flag, but you're missing a comma in your string. tio.run/##S85Pys/RTc8r/f8/… Jul 17, 2017 at 20:52
• So I am. I shall fix this. Jul 17, 2017 at 20:53
• You can save 10 bytes: PROGRAM-ID.H.PROCEDURE DIVISION.DISPLAY'Hello, World!'. Jul 21, 2020 at 22:03

# Numberwang, 77 bytes

69696969696969693696969623673363316969696968359533059595636969663633563583193


Try it online!

Just incrementing and decrementing the pointer by certain amounts.

• [Brainfuck translation, 72](220200949409153121212000717002230663002330030931131130003633113112300093) Apr 14, 2018 at 7:36

## Sqirrel - Peter, 903 bytes

A couple notes about my golfing:

• The examples have punctuation at the end of sentences but the spec doesn't say that it should be there so I left it off.
• The spec says The request consists firstly of the text "I wish I had a " then is followed by a thing. and list of the variable-things you can use: ... an Apple which is inconsistent so I used "I wish I had a Apple" because it is shorter.
• The spec says Here is [nr] [thing][s] Set the var to NR. Add an 's' if needed and even though the examples use Fishes the only ones that should be valid are Fish and Fishs and I chose Fish because I don't think it needs to be plural and it is shorter.
• There is an exit command but the spec doesn't say what happens if the flow reaches the end of the text so I am assuming the program ends and I didn't use the exit command.

Here is my attempt:

I wish I had a Fish
Here is 72 Fish
I wish I had a Fish
Now everyone has it
I wish I had a Fish
Here is 101 Fish
I wish I had a Fish
Now everyone has it
I wish I had a Apple
Here is 108 Apples
I wish I had a Apple
Now everyone has it
I wish I had a Apple
Now everyone has it
I wish I had a Forrest
Here is 111 Forrests
I wish I had a Forrest
Now everyone has it
I wish I had a Fish
Here is 44 Fish
I wish I had a Fish
Now everyone has it
I wish I had a Fish
Here is 32 Fish
I wish I had a Fish
Now everyone has it
I wish I had a Fish
Here is 87 Fish
I wish I had a Fish
Now everyone has it
I wish I had a Forrest
Now everyone has it
I wish I had a Fish
Here is 114 Fish
I wish I had a Fish
Now everyone has it
I wish I had a Apple
Now everyone has it
I wish I had a Fish
Here is 100 Fish
I wish I had a Fish
Now everyone has it
I wish I had a Fish
Here is 33 Fish
I wish I had a Fish
Now everyone has it

• If I count correctly, that's 66 more bytes for the version with correct punctuation and grammar. I.e. an apple, 100 fishes, etc. and a dot at the end of each line.
– Cœur
Aug 24, 2017 at 13:15

 ;I-      &  e$& m- & g2Ph$      &  a2$& n$      &  e2+-      &  g2Ph$& OPh$      &  m-      &  e-      &  n-
}     AgR};      AgR};      A=AgR};         AgR};       AgR};      AgR};        AgR};         AgR};        AgR};      AgR};      AgR};      AC


Try it online!

Diagonal }; turn IP right. I-, e$, m-, etc. create ascii code in the accumulator and push it on both stacks. A print char. gR};& move IP to the first line. = swap stacks. C exit. # Japt, 1514 11 bytes (using the ISO/IEC 8859 character encoding) Japt is a shortened version of JavaScript. Interpreter HÁM, Wld!  There's an unprintable char in there, so here's a hexdump: 60 48 C1 4D 2C 20 57 8E 6C 64 21  H Á M , W . l d !  Recently, @Vɪʜᴀɴ has helped me add in the shoco library for compressing strings. Using backticks around a string tells the interpreter to automatically decompress the string, and when a backtick is needed at the end of a program, you can leave it off. Thus, Japt now beats or ties all languages that don't have some sort of built-in to obtain "Hello, World!". (Including Pyth :D) ## 095, 16 bytes 'Hello, World!'s  First answer in my attempt at making a programming language! Pushes Hello, World! to the stack and then prints. • Welcome to PPCG! Jan 25, 2018 at 20:43 # AlphaBeta, 68 bytes kjjjggDLeaCLcbbbCLLaaaCLjjjggDLjhhDLsFihhDLCLaaaCLdaaaaCLdaaCLsFiiDL  Try it online! # Atari Logo, 21 bytes Code: PRINT [HELLO, WORLD!]  Result: # Aubergine, 29 bytes -a1=oA-a1:bA=iB\0!dlroW ,olleH  Where \0 is a null byte Try it online! ### Explanation -a1 Decrement a (now points to H) =oA Output *a (loop starts here) -a1 Decrement a :bA If *a is not 0 (we're not at null byte), jump to b (which is 0). IP then moves by 3, so IP starts at 3 next tick =iB Else move IP to *b, which is the character code of -, moving us out of bounds and ending execution without error. \0!dlroW ,olleH  # ELVM-IR, 1166866 65 bytes .data .string"Hello, World!"load B,A putc B add A,1jne 0,A,13exit  Thanks to @ASCII-only for golfing off 48 50 51 bytes! Try it online! ### Background Running the above program with eli <file> interprets it, but elc -<target> <file> is where the real magic happens: it translates ELVM-IR source code to any of the supported backends! Try it online! The ELVM toolchain also supports compiling (a subset of) C and its standard library to ELVM-IR. Try it online! • 78 bytes Apr 11, 2018 at 4:41 • 68 bytes Apr 11, 2018 at 4:56 • 40% shorter now. Thank you! Apr 11, 2018 at 5:18 • golfed another two bytes off :P Apr 13, 2018 at 4:57 • Looks weird, but it works. Thanks! Apr 13, 2018 at 5:20 # Nikud, 672 bytes ֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֱֲֳֳֳֳֳֳֳֳֳֳֳֳֳֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶֶַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַַָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָָ  Try it online Even though it has tons of bytes, it's top 3 in width, as all the characters are diacritical marks. There isn't much useful to explain. The character codes are put in reverse order into the stack using mostly אֱ (push 1), אֶ (dup) and אַ (add). Then אֵ (print as char) is called 13 times. Another thing that adds to the byte count is that each character is represented by 2 bytes in UTF-8. So it's actually 336 characters. • I think this can be golfed more using multiplication. Jun 14, 2018 at 5:17 # Pikachu, 1562 bytes So simple even Pikachu can do it! pi pi pika pi pi pika pi pi pika pi pikachu pi pika pi pika pikachu pi pika pika pikachu pi pika pi pi pika pi pi pika pi pikachu pi pikachu pi pikachu pikachu pikachu pi pikachu pika pi pika pi pi pikachu pi pikachu pi pi pikachu pi pika pi pikachu pikachu pikachu pi pikachu pika pi pika pi pi pikachu pi pikachu pi pi pika pi pi pika pi pika pi pikachu pi pika pi pikachu pikachu pikachu pi pikachu pika pi pika pi pi pikachu pi pikachu pi pi pika pi pi pika pi pika pi pikachu pi pika pi pikachu pikachu pikachu pi pikachu pika pi pika pi pi pikachu pi pikachu pi pi pika pi pi pika pi pi pika pi pika pi pikachu pi pika pi pikachu pikachu pikachu pi pikachu pika pi pi pi pika pi pi pikachu pi pikachu pi pikachu pi pi pika pi pi pikachu pi pika pi pikachu pikachu pikachu pi pikachu pika pi pi pi pika pi pikachu pi pikachu pi pikachu pikachu pi pi pikachu pi pika pi pikachu pikachu pikachu pi pikachu pika pi pi pika pi pi pika pi pi pika pi pikachu pi pikachu pi pikachu pika pi pi pika pi pi pika pi pikachu pi pika pi pikachu pikachu pikachu pi pikachu pika pi pika pi pi pikachu pi pikachu pi pika pi pika pi pi pika pi pi pika pi pi pika pi pikachu pi pika pi pikachu pikachu pikachu pi pikachu pika pi pi pika pi pi pika pi pi pika pi pi pika pi pi pika pi pikachu pi pika pi pikachu pikachu pikachu pi pikachu pika pi pi pika pi pi pika pi pi pika pi pikachu pi pika pi pikachu pikachu pikachu pi pikachu pikachu pikachu pika pikachu pika pi pi pi pika pi pikachu pi pika pi pikachu pi pikachu pika pi pi pika pi pikachu pikachu pikachu pi pikachu  Try it at Trove42! (Copy and paste above text) ### Commented # H pi pi pika pi pi pika pi pi pika pi pikachu # push 9 to pi stack pi pika # copy top of pi stack, 9, to pika stack pi pika pikachu # push 1 to pika stack pi pika pika pikachu # add top two elements of pika stack # push result, 10, to pika stack pi pika pi pi pika pi pi pika pi pikachu # push 9 to pi stack pi pikachu pi pikachu # multiply top two elements of pi stack # push result, 72, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 72, # to ASCII, 'H', and print # e pika pi # copy top of pika stack, 10, to pi stack pika pi # copy top of pika stack, 10, to pi stack pi pikachu pi pikachu # multiply top two elements of pi stack # push result, 100, to pi stack pi pi pikachu # push 1 to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 101, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 101, # to ASCII, 'e', and print # l pika pi # copy top of pika stack, 10, to pi stack pika pi # copy top of pika stack, 10, to pi stack pi pikachu pi pikachu # multiply top two elements of pi stack # push result, 100, to pi stack pi pi pika pi pi pika pi pika pi pikachu # push 8 to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 108, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 108, # to ASCII, 'l', and print # l pika pi # copy top of pika stack, 10, to pi stack pika pi # copy top of pika stack, 10, to pi stack pi pikachu pi pikachu # multiply top two elements of pi stack # push result, 100, to pi stack pi pi pika pi pi pika pi pika pi pikachu # push 8 to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 108, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 108, # to ASCII, 'l', and print # o pika pi # copy top of pika stack, 10, to pi stack pika pi # copy top of pika stack, 10, to pi stack pi pikachu pi pikachu # multiply top two elements of pi stack # push result, 100, to pi stack pi pi pika pi pi pika pi pi pika pi pika pi pikachu # push 11 to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 101, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 111, # to ASCII, 'o', and print # "," (comma) pika pi # copy top of pika stack, 10, to pi stack pi pi pika pi pi pikachu # push 4 to pi stack pi pikachu pi pikachu # multiply top two elements of pi stack # push result, 40, to pi stack pi pi pika pi pi pikachu # push 4 to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 44, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 44, # to ASCII, ',', and print # " " (space) pika pi # copy top of pika stack, 10, to pi stack pi pi pika pi pikachu # push 3 to pi stack pi pikachu pi pikachu # multiply top two elements of pi stack # push result, 40, to pi stack pikachu pi pi pikachu # push 2 to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 32, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 32, # to ASCII, ' ', and print # W pika pi # copy top of pika stack, 10, to pi stack pi pika pi pi pika pi pi pika pi pikachu # push 8 to pi stack pi pikachu pi pikachu # multiply top two elements of pi stack # push result, 80, to pi stack pika pi pi pika pi pi pika pi pikachu # push 7 to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 87, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 87, # to ASCII, 'W', and print # o pika pi # copy top of pika stack, 10, to pi stack pika pi # copy top of pika stack, 10, to pi stack pi pikachu pi pikachu # multiply top two elements of pi stack # push result, 100, to pi stack pika pi # copy top of pi stack, 100, to pika stack pi pika pi pi pika pi pi pika pi pi pika pi pikachu # push 11 to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 111, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 101, # to ASCII, 'o', and print # r pika pi # copy top of pika stack, 100, to pi stack pi pika pi pi pika pi pi pika pi pi pika pi pi pika pi pikachu # push 14 to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 114, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 114, # to ASCII, 'r', and print # l pika pi # copy top of pika stack, 100, to pi stack pi pika pi pi pika pi pi pika pi pikachu # push 8 to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 101, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 101, # to ASCII, 'e', and print # d pikachu pikachu pika pikachu # convert top of pika stack, 100, # to ASCII, 'd', and print # "!" (exclaimation point) pika pi # copy top of pika stack, 10, to pi stack pi pi pika pi pikachu # push 3 to pi stack pi pika # copy top of pi stack, 3, to pika stack pi pikachu pi pikachu # multiply top two elements of pi stack # push result, 30, to pi stack pika pi # copy top of pika stack, 3, to pi stack pi pika pi pikachu # add top two elements of pi stack # push result, 33, to pi stack pikachu pikachu pi pikachu # convert top of pi stack, 33, # to ASCII, '!', and print  # 𒅴 𒆰, 21 bytes 𒁺("Hello, World!")  Try it online! This is a language written in Cuneiform, and uses Sumerian words as keywords. At its heart, this is just a translation of Python into Sumerian, but in the future there will be new features added, such as the Babylonian numeral system (which works in base 60). Because it relies heavily on unicode, this is not going to be a very good golfing language. • You could always translate from unicode to a golfier encoding :P Dec 26, 2018 at 0:10 # axo, 22 bytes "!dlroW ,olleH"[>[(#<\  Try it online! Pushes "Hello, World!" to the stack "!dlroW ,olleH" Duplicates top of stack afterward, which results in "HHello, World!" [ Moves to the right >. Duplicates it again, which results in "HHHello, World!" [ Outputs "H" while popping from the stack, so the stack is "HHello, World!" ( Pops the top of the stack, results in "Hello, World!" # Moves left < Pops the top of the stack, results in "ello, World!" # Outputs "e" while popping from the stack, which results in STDOUT being "He" and the stack being "llo, World!" ( Duplicates the top of the stack, resulting in the stack being "lllo, World!" [ Moves right. > And I'm sure you can figure out the rest. If you can't, I'll update a more indepth-explanation soon. # ]=[, 164 bytes [=======[==]]=[[=[[=]]=[[=[[========]]][]=[]=[[=[=[=]]][]=[[====[====]]=[[===[==]]=[[========[=======]]=[]=[[=[=[====]]=[[=[[========]]=[[=[[]]=[[===[===]]=[[=[]]=[  ]=[ was a language which only uses the symbols ], =, and [. The ]=[ interpreter is written in 12-Basic. • There's something amusing about the fact that the ]=[ interpreter at the link is written in the 12-basic interpreter. May 31, 2018 at 20:18 • Permalink no longer works Dec 26, 2018 at 1:07 • now I can't find the interpreter... Dec 28, 2018 at 3:18 • I was looking through some old files and I found the interpreter, finally. Mar 13, 2019 at 21:32 # Bootable x86 machine code, 512 bytes Hexdump: 31 c9 8e d9 be 10 7c b1 0d ac b4 0e cd 10 e2 f9 |1.....|.........| 48 65 6c 6c 6f 2c 20 57 6f 72 6c 64 21 00 00 00 |Hello, World!...| * 00 00 00 00 00 00 00 00 00 00 00 00 00 00 55 aa |..............U.|  * represents 464 bytes of padding required to place the bootable flag (55 aa) at offset 510. This is the same as the following assembler code, which can be assembled using nasm hello.asm -f bin -o hello.bin, assuming the assembler code is in a file called hello.asm [ORG 0x7C00] [BITS 16] xor cx, cx ; Set cx to 0 mov ds, cx ; Set ds to cx (0) mov si, msg ; Set si to the address of the message mov cl, 13 ; Set cx to 13 (the size of the message) print_loop: ; For each character in the message: lodsb ; Set al to the character mov ah, 0x0E ; Set ah to 0x0E int 0x10 ; Call interrupt 0x10 (video services) with ah set to 0x0E (print al to screen) loop print_loop ; Decrement cx and continue the loop if cx > 0 msg: db 'Hello, World!' times 510 - ($-) db 0
db 0x55
db 0xAA


## Running

The code can be runned with QEMU using the following command, assuming the binary code is saved in a file called hello.bin:

qemu-system-x86_64 -drive format=raw,file=hello.bin

• Can you assume that regs like cx are already cleared? May 7, 2019 at 5:32

# Triangular, 55 bytes

6\6+@*8\C::6--::@\@#2"+3^82*@3/#-<*#+/@"#+F<3/3@@#-7:*<


This one took a while. Also will be very difficult to golf, since there is zero no-ops in it, meaning you'll have to save 10 bytes to get it to a size 9 triangle in order to save any bytes

This expands out into this size 10 triangle:

         6
\ 6
+ @ *
8 \ C :
: 6 - - :
: @ \ @ # 2
" + 3 ^ 8 2 *
@ 3 / # - < * #
+ / @ " # + F < 3
/ 3 @ @ # - 7 : * <


# How it works

Note: this ignores all control flow characters and just looks at what gets run in order

66* Push 36
:: Duplicate it twice
2*# Output H, popping it
3*  Multiplies by 3, yielding 108
:   Duplicates
-7# Outputs e, popping it
@@  Outputs l twice, without popping it
3+@ Outputs o, without popping it
" Swaps, putting 36 at the top of the stack
:: Duplicates it twice
8+@  Outputs comma, without popping
C-#  Outputs space, popping the top of the stack
2*F+# Outputs W, popping it
"     Swaps back around, putting 111 at the top of the stack
@     Outputs o, without popping
3+@   Outputs r, without popping
6-@   Outputs l, without popping
8-#   Outputs d, whilst popping
3-@   Subtracts 3 from 36, giving !, and outputs it
6     Pushes 6, which does nothing


Try it Online!

• Rearranging the structure, I can get you 3 no-ops, though really it's only one byte TIO. Only 7 more to go!
– Jo King
Aug 25, 2019 at 21:40
• 2 more. Halfway there.
– Jo King
Aug 25, 2019 at 21:50
• Ok, I've got all the characters onto the stack in a size 9 triangle, but I dont have any space to put a loop to print all of them. Maybe could be golfed slightly more to fit it in TIO Aug 26, 2019 at 6:10

## Pxem, 0+17=17 bytes

Using the filename as data without counting the length is cheating. Therefore it is 17 bytes. (It even uses the filename extension as part of the program!)

Save the program as

Hello, World!.pxe


and the file contents should be empty.

• You know, just testing Feeds...
– user85052
Jan 10, 2020 at 4:07

# Verbosity v2, 152 bytes

IncludeTypePackage<OutputSystem>
IncludeTypePackage<StringArray>
outpu=OutputSystem:NewOutput<DEFAULT>
OutputSystem:DisplayAsText<outpu;"Hello, World!">


Try it online!

Introducing Verbosity v2! This is a short as it gets, as variable names must be 5 characters or more. The ungolfed version isn't much different:

IncludeTypePackage<OutputSystem>
IncludeTypePackage<StringArray>

output = OutputSystem:NewOutput<DEFAULT>

OutputSystem:DisplayAsText<output; "Hello, World!">


Try it online!

And it's pretty obvious how it works.

• 87 bytes Jul 1 at 12:59

with Text_IO;procedure H is
begin
Text_IO.Put("Hello, World!");end;


Thanks to 3D1T0R and breadbox for improving this!

Try it online!

• I'm not all that familiar with Ada, but took a swing at 'golf'ing this down a bit. Please evaluate: ideone.com/JjmhIt 75 bytes. May 29, 2018 at 19:31
• Also note that the Ada. can be dropped (both places) to save 8 bytes. May 29, 2018 at 21:20
• Wow, somebody replied to this over a year later! You can combine 3D1T0R's golf with breadbox's tip to golf it down quite a bit. May 30, 2018 at 20:25
• @breadbox: I could have sworn I tried that, but apparently not. I kind of doubt this can be golfed much more. May 31, 2018 at 21:22
• TIO link pls Dec 26, 2018 at 1:02

# Keg, 15 8 bytes

«H%c¡|,!


Try it online!

Wow. It's been a while since I posted this. And boy oh boy how Keg has changed.

### Explained

« #Start a special compressed string
H% #String compression code (SCC) for "Hello"
c¡ #SCC for "World"
|,! #Join "Hello" and "World" with a , and ! to create "Hello, World!"
« #Close the special compressed string and implicitly print


## Old Program

Hello\, World\!


Keg is a newly created stack-based, golfing language, which focuses on only having symbols as functions and keywords. As such, alphanumeric characters are pushed to the stack as letters (even spaces are pushed, meaning that they aren't NOPs).

Symbols that would normally be commands can be escaped using \'s.

• Wow what a nerd using an outdated golfing language Oct 26, 2021 at 10:36

# Poetic, 324 bytes

the i/o case of HELLO
a good i/o drill is:say a HELLO
i said HELLO,saying it in Poetic
i code in Poetic,a good way to write a poem
a special piece for you
a special piece in machine writing for you
i already think i do pretty well writing for the machine poem
Poetic program syntax is nice
a perfect sorta poem and a program


Try it online!

This is nothing original, it's a straight port of the brilliant brainfuck answer from @KSab...but it turns out that it's the shortest representation of Hello, World! that I can find in Poetic. If anyone can golf this, please let me know; I'm definitely interested if someone can beat this solution!