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

To make sure that your answer shows up, please start your answer with a headline, using the following Markdown template:

## Language Name, N bytes


where N is the size of your submission. If you improve your score, you can keep old scores in the headline, by striking them through. For instance:

## Ruby, <s>104</s> <s>101</s> 96 bytes


If there you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the last number in the header:

## Perl, 43 + 2 (-p flag) = 45 bytes


You can also make the language name a link which will then show up in the snippet:

## [><>](https://esolangs.org/wiki/Fish), 121 bytes


/* Configuration */

var QUESTION_ID = 55422; // Obtain this from the url
// It will be like https://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page
var ANSWER_FILTER = "!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe";
var COMMENT_FILTER = "!)Q2B_A2kjfAiU78X(md6BoYk";
var OVERRIDE_USER = 8478; // This should be the user ID of the challenge author.

/* App */

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

function commentUrl(index, answers) {
return "https://api.stackexchange.com/2.2/answers/" + answers.join(';') + "/comments?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + COMMENT_FILTER;
}

jQuery.ajax({
method: "get",
dataType: "jsonp",
crossDomain: true,
success: function (data) {
data.items.forEach(function(a) {
var id = +a.share_link.match(/\d+/);
});
if (!data.has_more) more_answers = false;
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>)/;

var OVERRIDE_REG = /^Override\s*header:\s*/i;

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>
<link rel="stylesheet" type="text/css" href="https://cdn.sstatic.net/Sites/codegolf/all.css?v=ffb5d0584c5f">
<div id="language-list">
<h2>Shortest Solution by Language</h2>
<table class="language-list">
<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

# Fueue, 47 bytes

72 101 108 108 111 44 32 87 111 114 108 100 33H


# 3var, 65 bytes

iiisa-<*>P/>is+iP>PPm-iiiPi<O/<m/>+<O+d<+<O+><kkkOP->siskkkOP</>P


Here's a 3var program found by brute force. Note that this might not be optimal since I assume that we'll only ever need numbers in the range 0-150, for efficiency reasons. I'll probably address this in a later edit.

3var is a Deadfish variant which has, well, three variables A, B and R. The relevant commands are:

Command              A           B           other
-----------------------------------------------------------
Increment            i           a
Decrement            d           k
Square               s           m
Output as char       P           O
Copy from R          >           <
Set R = A+B                                  +
Set R = A-B                                  -
Set R = A*B                                  *
Set R = A div B                              /


And here's a trace:

Line           A     B     R     Output
----------------------------------------------------------------
iiisa-         9     1     8
<*             9     8     72
>P             72    8     72    H
/>             9     8     72    H
is+            100   8     108   H
iP             101   8     108   He
>PP            108   8     108   Hell
m-             108   64    44    Hell
iiiP           111   64    44    Hello
i<O            112   44    44    Hello,
/<m            112   4     2     Hello,
/>             28    4     28    Hello,
+<O            28    32    32    Hello,
+d<            27    60    60    Hello,
+<O            27    87    87    Hello, W
+><            114   114   114   Hello, W
kkkOP          114   111   114   Hello, Wor
->             3     111   3     Hello, Wor
siskkkOP       100   108   3     Hello, World
</             100   3     33    Hello, World
>P             33    3     33    Hello, World!

• @LegionMammal978 Do you mean esolang wiki? The site seems fine to me... – Sp3000 Sep 28 '15 at 2:39

# Tcl, 19 bytes

puts Hello,\ World!


I think this can get smaller than it already is.

• Is that missing the comma? – curiousdannii Aug 29 '15 at 13:00
• What comma do you mean? – Johannes Kuhn Aug 29 '15 at 13:06
• I'm just guessing, but will this print "Hello World!" rather than "Hello, World!"? – curiousdannii Aug 29 '15 at 13:10
• Right... Forgot that piece... – Johannes Kuhn Aug 29 '15 at 13:12

# 99, 283 bytes

999 9 9
99 99999999 999 9
99
99 99999 9 999 9
99
99 99 999 999999
99
99
99 9999999 9999 999 9
99
99 99 9999999 9 999 9 999 9 999 9
99
99 99 999999 9 999999 9
99
9999
99 99999 999 999999 999 9
99
99 9999999 9999 9 999 9
99
99 99 999999 9
99
99 99 999999 999 9
99
99 99999 9999999 9
99


This was handcrafted so it is very likely suboptimal. Someone should write a metagolfer...

The following table has been quite useful writing 99 code by hand:

Variable  /9%128    Can print?

9              1
99            11    !
999          111
9999          87    !
99999        103
999999         7    !
9999999       71
99999999      71    !


All further rep-digits of 9 also yield 71 when taken modulo 128 (after dividing by 9).

• All further rep-digits of 9 also yield 71 when taken modulo 128. you can't just drop these math facts like they're nothing.now i'm going to be amazed all day – undergroundmonorail Aug 30 '15 at 14:04
• @undergroundmonorail Note that it's actually the rep-digits of 1 which do this, because the variable is divided by 9 before taking the modulo. And the reason this works is that (710 % 128) happens to be 70. – Martin Ender Aug 30 '15 at 14:09

# KEMURI, 65 bytes

^^^^"^^'"'^'"'"^^^^'^''^"^^^^^^''^'"''"^^^^^^^'"^^'^'^''^'^'^|


There's a KEMURI to C compiler available here if you'd like to test.

KEMURI is stack-based, and has the following 6 instructions:

~    Pop byte and push its NOT
^    Pop two bytes and push their XOR
"    Duplicate top of stack
'    Rotate top three of stack (top becomes third)
Push the ASCII values of "Hello, world!"
|    Output stack as ASCII


Note that  pushes "Hello, world!" with a lowercase w. This means that the shortest "Hello, world!" program is

|


but that doesn't mean that the best "Hello, World!" program, with an uppercase w, will be particularly short.

To aid our search for the best "Hello, World!", here are a couple of observations:

• | empties the stack, so we will only need it exactly once, as the very last character in the program.
• ~ is useless, since NOT will flip the most significant bit to 1, which no printable ASCII character needs.
• We will never need to duplicate with " if the top two stack elements are the same, since:
• Rotating three identical elements is a no-op.
• The only way to reduce the stack size is with ^ XOR. XOR of two identical elements just introduces a 0 and XOR 0 is a no-op.
• "Hello, World!" contains neither a triple letter nor ASCII 0.

This means that we only need to look at the four instructions ^"'. To piece together the "Hello, World!", I looked at programs which contain a single , at the very start. This gives a bunch of "jigsaw pieces" which we can fit together to form the whole message. There's no guarantee that this approach is optimal, but the search space is pretty big, so any better solution will probably need to be a bit more intelligent.

The pieces I managed to obtain were (<sp> is trailing space):

World!   ^^^^^"^^^|
orld!    ^^^^^^^"^^|
rld!     ^^^^^^^^"^^|
ld!      ^^^^^^^^^"^^|
d!       "^^^^^^^^^^^^|
World!   ^^^^^"^'"'^'^|
<sp>     ^"^^^^^^^^^^^^|
!        ^^^^^^^^^^^"^^|
H        ^^^^^^^^^^'^"^^|
,        ^^^^^^^^^^''"^^^|
d        ^^^^^^^^^^''^"^^|
o        ^^^^''^"^^^^^^^^|
e        "^^^^^^'"^^^^^^^^|
W        ^"^^^^^^'"^^^^^^^|
l        ^^"^^^^'"^^^^^^^^|
, World! ^^^^"^^'"'^'"'"^^|
ld       ^^^^^^^^^"^^''"^^|
ll       ^^"^^^^'"^^^^^^^^"|
r        ^^^^^^'"^^^^'^"^^^|
rl       ^^^^^^'"^^^^''"^^''^|
He       ^^^^^'"^^'^'^''^'^'^|
el       ^^"^^^^^^^^''"^^''"^^|
o,       ^^'^"^^^^"'^'^'^'^'^'^|
Wo       ^^^^"^^^'"^^'^''^''^''^|
,<sp>    ^^^^^'^'^'^''^''^'"'^'^|
lo       ^^^^^^^"^^'"^^''"^^''"^^|
or       ^^^^^^'^"^^''"^^''"^^''^|
llo      ^^'^''^"^^^^^^''^'"''"^^|
ell      ^^"^^^^^^^^''"^^'"''"^^''|
W       ^"^^^^^^''^''^''^''^''^"'^|


The program at the top of the post was formed by combining the He, llo and , World! pieces.

# Aheui, 177 bytes

밣밢따빠빠빠맣밤밢따다빠빠빠밠타맣맣맣받다맣밠밤따타맣밤밣따맣받발따다빠맣밦밤따다빠빠맣받다맣받타빠맣밣타빠맣받나맣희


Aheui is Befunge, but with Hangul. Test this here.

# MicroSoft Windows HTA - 13 bytes

Hello, World!


MicroSoft Windows HTA occupies a niche between HTML and applications, where you get the simplicity and ease of HTML, with the direct access to the system API of applications, including file and system calls.

When I was first introduced to it, I wondered how I ever got along without it. I used it to make really easy intuitive interfaces for complex command line utilities.

Sadly, it's fallen by the wayside and you hardly hear about it anymore. One thing I remember about the official documentation was that they boasted how a bare Hello, World! is a legal hypertext application.

# Swift, 22 Bytes

### Before Version 2.0 (24 Bytes)

println("Hello, World!")


### After Version 2.0 (22 Bytes)

print("Hello, World!")


Includes trailing newline

Top level code in the main file gets executed automatically. In playgrounds, anything at top level gets executed as well.

In version 2.0 beta 6 this is also possible:

print("Hello,", "World!")


which will print all the items provided, separated by a space, terminated by a newline. This is equal to the following (which is probably the longest Swift version of a non-ridiculous "Hello, World!" program):

print("Hello,", "World!", separator: " ", terminator: "\n")


Since version 2.0 beta 6, Swift is one of the few languages that can have a vararg parameter at any position (not just the end), due to named parameters.

# Commodore Basic, 16 bytes

In order to input this program, you'll need to switch your Commodore 64 to character set 2 by pressing <SHIFT> + <C=>.

1?"hELLO wORLD!


The Commodore home computers come with two character sets: "unshifted" mode, which is derived from ASCII-1963 and so lacks lower-case letters, and "shifted" mode, which has both lower- and upper-case letters, but in the opposite order from modern ASCII-1967-derived encodings. Any "Hello, World!' program that produces the requested byte stream on a Commodore will look funny on the Commodore's screen. In the interests of not having to look up a half-dozen obscure Unicode characters, I've chosen to write my program in "shifted" mode, which merely has reversed case.

As a side note, the Commmodore Basic interpreter (and presumably many other Microsoft Basic variants) will let you omit the trailing quotation mark if a string extends to the end of the current source line.

# FlogScript, 17 bytes

{Hello, World!}P.


# Actionscript 3.0, 23 22 bytes

trace("Hello, World!")

• Does actionscript 3.0 REQUIRE semi-colons? I stopped after 2.0 but I don't think it did back then. – Albert Renshaw Sep 29 '15 at 21:27
• @AlbertRenshaw is correct, it doesn't require a semi-colon in 3.0. – Elliot Blackburn Oct 2 '15 at 14:17
• This works in the Actions pane of the Flash IDE, but Flash Builder or the Actionscript compiler, you need a full class definition. – Brian Jan 15 '16 at 18:54

# Perl, 18 bytes

say"Hello, World!"


### Remark:

"say" is used in Perl 6. While "print" is a Perl 5 thing. But "say" can be used in version 5.10+ when the -M5.010 switch (or -M for a higher version) is used.

## Perl 5 without version switch, 20 bytes

print"Hello, World!"


### Perl/Tk, 91 Bytes

Ok, this doesn't exactly print to STDOUT as was requested by the challenge. Since it creates a window with a button. So this was just added for the sake of entertainment/completeness.

use Tk;MainWindow->new->Button(-text=>"Hello, World!",-command=>sub{exit})->pack();MainLoop


• You can shave off 2 bytes by replacing print with say, provided the OP agrees with this meta post in -M5.010 being free. – Slade Aug 28 '15 at 15:54
• I knew "say" is used in Perl 6, but didn't realise they added it to a more recent version of Perl 5 than the one I use. So I added both to the post. – LukStorms Aug 28 '15 at 19:42
• There is another Perl 6 answer, so maybe you could just post the Perl 5 one. – LegionMammal978 Sep 1 '15 at 21:41

# Beam, 128 120 Bytes

'''''''''>++++++++)@'''P''''>++++)+@+++++++@P@+++@'P'L'''>++++++)''P'>++++)@''p@'p>+++++)@'p@+++@p@--------@''p+@H


This uses the general construct:

'''''''''              # increment store to 9
>             # set direction right. Beginning of loop
            # decrement store
++++++++    # increment beam 8
)   # set direction left if store not 0. End of loop
@  # Output character


Effectively translates to 9 * 8. The store needs to be odd before entering the loop otherwise it will end up being an infinite loop. The Esolangs has examples of this at the bottom in the constants section.

P is used to save to l, o and memory slots 0, 1 and 2.
p is used to retrieves those values to the beam.

The following snippet should run Beam programs, but it hasn't been put through the ringer yet, so is likely to have some bugs.

var ITERS_PER_SEC = 100000;
var TIMEOUT_SECS = 50;
var ERROR_INTERRUPT = "Interrupted by user";
var ERROR_TIMEOUT = "Maximum iterations exceeded";
var ERROR_LOSTINSPACE = "Beam is lost in space";

var code, store, beam, ip_x, ip_y, dir, input_ptr, mem;
var input, timeout, width, iterations, running;

function clear_output() {
document.getElementById("output").value = "";
document.getElementById("stderr").innerHTML = "";
}

function stop() {
running = false;
document.getElementById("run").disabled = false;
document.getElementById("stop").disabled = true;
document.getElementById("clear").disabled = false;
document.getElementById("timeout").disabled = false;
}

function interrupt() {
error(ERROR_INTERRUPT);
}

function error(msg) {
document.getElementById("stderr").innerHTML = msg;
stop();
}

function run() {
clear_output();
document.getElementById("run").disabled = true;
document.getElementById("stop").disabled = false;
document.getElementById("clear").disabled = true;
document.getElementById("input").disabled = false;
document.getElementById("timeout").disabled = false;

code = document.getElementById("code").value;
input = document.getElementById("input").value;
timeout = document.getElementById("timeout").checked;

code = code.split("\n");
width = 0;
for (var i = 0; i < code.length; ++i){
if (code[i].length > width){
width = code[i].length;
}
}
console.log(code);
console.log(width);

running = true;
dir = 0;
ip_x = 0;
ip_y = 0;
input_ptr = 0;
beam = 0;
store = 0;
mem = [];

input = input.split("").map(function (s) {
return s.charCodeAt(0);
});

iterations = 0;

beam_iter();
}

function beam_iter() {
while (running) {
var inst;
try {
inst = code[ip_y][ip_x];
}
catch(err) {
inst = "";
}
switch (inst) {
case ">":
dir = 0;
break;
case "<":
dir = 1;
break;
case "^":
dir = 2;
break;
case "v":
dir = 3;
break;
case "+":
++beam;
break;
case "-":
--beam;
break;
case "@":
document.getElementById("output").value += String.fromCharCode(beam);
break;
case ":":
document.getElementById("output").value += beam+"\n";
break;
case "/":
switch (dir) {
case 0:
dir = 2;
break;
case 1:
dir = 3;
break;
case 2:
dir = 0;
break;
case 3:
dir = 1;
break;
}
case "\\":
switch (dir) {
case 0:
dir = 3;
break;
case 1:
dir = 2;
break;
case 2:
dir = 1;
break;
case 3:
dir = 0;
break;
}
break;
case "!":
if (beam != 0) {
switch (dir) {
case 0:
dir = 1;
break;
case 1:
dir = 0;
break;
case 2:
dir = 3;
break;
case 3:
dir = 2;
break;
}
}
break;
case "?":
if (beam == 0) {
switch (dir) {
case 0:
dir = 1;
break;
case 1:
dir = 0;
break;
case 2:
dir = 3;
break;
case 3:
dir = 2;
break;
}
}
break;
case "|":
switch (dir) {
case 0:
dir = 1;
break;
case 1:
dir = 0;
break;
}
break;
case "_":
switch (dir) {
case 0:
dir = 1;
break;
case 1:
dir = 0;
break;
}
break;
case "H":
stop();
break;
case "S":
store = beam;
break;
case "L":
beam = store;
break;
case "s":
mem[beam] = store;
break;
case "g":
store = mem[beam];
break;
case "P":
mem[store] = beam;
break;
case "p":
beam = mem[store];
break;
case "u":
if (beam != store) {
dir = 2;
}
break;
case "n":
if (beam != store) {
dir = 3;
}
break;
case "":
--store;
break;
case "'":
++store;
break;
case ")":
if (store != 0) {
dir = 1;
}
break;
case "(":
if (store != 0) {
dir = 0;
}
break;
case "r":
if (input_ptr >= input.length) {
beam = 0;
} else
{
beam = input[input_ptr];
++input_ptr;
}
break;
}
// Move instruction pointer
switch (dir) {
case 0:
ip_x++;
break;
case 1:
ip_x--;
break;
case 2:
ip_y--;
break;
case 3:
ip_y++;
break;
}
if (running && (ip_x < 0 || ip_y < 0 || ip_x >= width || ip_y >= code.length)) {
error(ERROR_LOSTINSPACE);
}
++iterations;
if (iterations > ITERS_PER_SEC * TIMEOUT_SECS) {
error(ERROR_TIMEOUT);
}
}
}
<div style="font-size:12px;font-family:Verdana, Geneva, sans-serif;">Code:
<br>
<textarea id="code" rows="3" style="overflow:scroll;overflow-x:hidden;width:90%;">'''''''''>++++++++)@'''P''''>++++)+@+++++++@P@+++@'P'L'''>++++++)''P'>++++)@''p@'p>+++++)@'p@+++@p@--------@''p+@H</textarea>
<br>Input:
<br>
<textarea id="input" rows="2" style="overflow:scroll;overflow-x:hidden;width:90%;"></textarea>
<p>Timeout:
<input id="timeout" type="checkbox" checked="checked">&nbsp;
<br>
<br>
<input id="run" type="button" value="Run" onclick="run()">
<input id="stop" type="button" value="Stop" onclick="interrupt()" disabled="disabled">
<input id="clear" type="button" value="Clear" onclick="clear_output()">&nbsp; <span id="stderr" style="color:red"></span>
</p>Output:
<br>
<textarea id="output" rows="6" style="overflow:scroll;width:90%;"></textarea>
</div>

# BitShift, 216211 209 bytes

Introducing my first esolang;
BitShift is a language which can only operate on 1 value, and use a limited set of bit-shifting instructions to modify it.
Therefore it's challenging to write programs and it's not great for golfing.

A valid Hello, World! is 209 bytes long, and this is believed optimal. Generated by this metagolf.

10111110111110101001011001001010111011111010011010100101011001000100101011001000001100101011111110011010100101100110010001000100101011110100110110101001000010001010110111101110111101010001000010101111101101010


You can test it here.

## Dogescript, 42 37 bytes

plz console.loge with "Hello, World!"


Translates to console.log("Hello, World!").

• plz console.loge with "Hello, World!"is shorter, but admittedly less wow – kvill Aug 31 '15 at 15:21
• Is the plz necessary? I thought you could just console.loge. – Alex A. Sep 2 '15 at 5:59
• @AlexA. doesn't work without plz in the online interpreter, in accordance with the specs – kvill Sep 2 '15 at 19:56
• That's what I was thinking... – LegionMammal978 Sep 3 '15 at 10:57

## Simplex, 16 bytes

"Hello, World!"g


g is the standard output mechanism.

• Thanks for using Simplex :D – Conor O'Brien Oct 26 '15 at 11:21

# pl, 13 bytes

Hello, World!


Yes, it works. Try it online.

## Explanation

In pl, all printable ASCII chars (between 0x20 and 0x7E in CP437) are reserved for variable names. Normally, these chars push the contents of that variable onto the argument stack. BUT, if the variable doesn't actually exist, pl assumes that this is actually the start of a string literal. The string literal is closed when it encounters a variable that exists or a function char. In this case, since none of these variables have been defined, Hello, World! gets pushed onto the stack as a string and printed implicitly at the end.

# Whenever, 25 bytes

Whenever is a programming language which has no sense of urgency. It does things whenever it feels like it, not in any sequence specified by the programmer. Since Whenever code is not necessarily executed sequentially, lines of code become more like "to-do" lists, which the language interpreter may tackle in any order it likes.

1 print("Hello, World!");


# PlatyPar, 14 bytes

"Hello, World!


In PlatyPar (my language that is still in development), parens, quotes, brackets, etc. are automatically closed at the end of the line. Additionally, the last item on the stack (in this case, "Hello, World!") is implicitly printed.

Try it here!

## Acc!!, 122 bytes

Due to limitations of the scoreboard snippet, the title of this post is incorrect. The correct name of this language is Acc!! with italics.

108
Write 72
Write 101
Write _
Write _
Write 111
Write 44
Write 32
Write 87
Write 111
Write 114
Write _
Write 100
Write 33


The first line stores 108 (char code for l) in the accumulator. The rest writes Hello, World! one character at a time, with _ referencing the accumulator value. Using the accumulator beats the straightforward version by 2 bytes. :^)

Works the same in Acc!.

• @quartata Thanks for the edit, but italics in the language name breaks the scoreboard. – DLosc Jan 20 '16 at 22:56
• Ah. Sorry, didn't realize :P – a spaghetto Jan 20 '16 at 23:45
• Maybe the scoreboard snippet should be updated. – mbomb007 Jan 22 '16 at 17:58

# VHDL, 98 bytes

entity m is
end;architecture a of m is
begin
process
begin
report"Hello, World";end process;end a;


At least it's not Java...

• class a{public static void main(String[]a){System.out.print("Hello, World!");}} Nope, you've been Java'd. Also this appears to print "Hello World", not "Hello, World!" – CalculatorFeline Mar 25 '16 at 23:56

# Y 16 bytes

No, not http://foldoc.org/Y or https://github.com/ConorOBrien-Foxx/Y although we probably need an entry for both of them as well...

Y is a stack-oriented FORTH-type programming language by Thomas Fischbacher derived from Wouter van Oortmerssen's "FALSE". Like FALSE, Y is cryptic to the extreme. According to the readme it is much more powerful because "virtually all of the example programs in 'Kernighan & Ritchie - Programming in C' can be done in Y in a fraction of time and code."

"Hello, World!"


## Kotlin, 50 48 bytes

fun main(a:Array<String>)=print("Hello, World!")


# Fuzzy Octo Guacamole, 15 bytes

"Hello, World!"


This is a new language I created with inspiration from @Conor's NTFJ, @MatinBüttner's Brian and Chuck, and a couple others.

It has 2 stacks.

This is fairly simple and only uses one stack though.

The "..." denotes a string literal that is pushed to the stack.

Then implicit output.

# Pyramid, 587 294 bytes

(72)[
no
+<
]
=
a
<
=
np
<
=
(29)[
no
+<
]
=
a
<
=
np
+<
=
a
++++++<
=
np
<
=
a
<
=
np
+<
=
a
++<
=
np
<
=
(67)[
no
-<
]
=
a
<
=
np
-<
=
a
-----------<
=
np
<
=
(55)[
no
+<
]
=
a
<
=
np
<
=
(24)[
no
+<
]
=
a
<
=
np
<
=
a
+++<
=
np
<
=
a
------<
=
np
<
=
a
--------<
=
np
<
=
(67)[
no
-<
]
=
a
<


Yikes... this is a monstrosity. This is now less of a monstrosity, but still crazy big for "Hello, World!".

The new byte count was because for-loops were implemented in Pyramid (YES!)

Pyramid is a stack-based language, which was built on Stackylogic. You should probably go and click on the link before you go to the Github page, because you'll understand the what the commands mean on the GH page better.

There's 250 104 lines of code here, if you're interested.

• link 404 why :(? – Destructible Lemon Sep 23 '16 at 3:09
• @DestructibleWatermelon Oh yeah, that's because I stopped working on Pyramid. – clismique Sep 23 '16 at 6:40

# Processing, 23 bytes

print("Hello, world!");


It also opens a window for drawing, but this message does go to stdout in the IDE.

I don't understand why more people don't use Processing over Java for code golf. With most of the boilerplate removed, you can almost always outdo it with the same syntax.

# Codelike, 127 bytes

on++++++++n+++n+++**pn++++n+++++++*+ap+++++++pp+++pn++++n++++++++*pfn++n++++*ap________p+++p______p________pn++++n++++++++*+pfe


Try it!

# *><>, 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 :) – Teal pelican Dec 19 '16 at 14:47

# Pushy, 16 bytes

Hello, World!"


Try it online!

The first thing to note is that Pushy has no string type. The backticks open/close "stringmode": every character in between has its codepoint (as an integer) pushed to the stack. The " is the print command, which takes all the stack's values, converts them to the corresponding chars, and prints the string.

In the very first version, before stringmode was implemented, program looked like this (can probably be golfed more):

72HhH8+&&3+44 32 87 111&3+&6-H33"


It basically just appends the necessary ASCII code points, then prints.

# DUP, 31 bytes

0$"Hello, World!"\[^^>][$;,1+]#


DUP is a descendant of FALSE, with FALSE being a subset of DUP in most aspects—with a few exceptions. One exception being the way strings are handled. See the FALSE solution in this thread for comparison. In DUP, strings cannot be ouput to STDOUT directly unless the characters are output one by one like this:

'H,'e,'l,'l,'o,',,' ,'W,'o,'r,'l,'d,'!,     (this solution would be 39 bytes long)


' pushes the Integer value of the following character on the data stack. , prints the character according to the integer value on the stack to STDOUT.

For shorter strings, this method is usually the shortest way, but in the case of Hello, World! this method is beyond the break even point of the actual string handling method of DUP.

0$"Hello, World!"\[^^>][$;,1+]#


This method successively assigns the characters between both double quotes " to addresses of a cell array, starting at a given address (in this case address 0).

In this case, the cells would carry the values

0=72 1=101 2=108 3=108 4=111 5=44 6=32 7=87 8=111 9=114 10=108 11=100 12=33


After assigning the values to the cells, the length of the stored string gets pushed on the stack (in this case 13). The while loop [^^>][\$;,1+]# at the end reads out the cell content, starting at 0, prints the according character to STDOUT, increments the counter, and repeats the procedure until the string length 13` is reached.

Try out the solution in this online DUP interpreter or clone my DUP interpreter written in Julia from my GitHub repository, the latter coming with a thorough explanation of all operators.