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

# Forked, 42 bytes

89*@AA*i@7+@@3+@4B*@C'!sF+!@3+@6'@8'!3B*!&


Try it online!

# AlphaBeta, 68 bytes

kjjjggDLeaCLcbbbCLLaaaCLjjjggDLjhhDLsFihhDLCLaaaCLdaaaaCLdaaCLsFiiDL


Try it online!

# Dodos, 167164160 159 bytes

	* 2
1 0 4
L
L
1 *
4 3 1
2 1 1
2 2 3
1 *
4 *
L
+ 0 0 4
3 1 1
L
3 1 4
*
2 4
+
dot
i
+ j
j

dip + dab
0

1
i + 0
2
i 1
3
i 2
4
i 3


@Thanks to @Leo for golfing off 1 byte!

Try it online!

# x86/x86_64 on Linux, 34 32 31 bytes

00:      e8 0d 00 00 00          call   <+0x12>
05:      48 65 6c 6c 6f 2c 20 57 6f 72 6c 64 21
"Hello, World!"
12:      59                      pop    %ecx
13:      6a 01                   push   $0x1 15: 5b pop %ebx 16: 6a 0d push$0xd
18:      5a                      pop    %edx
19:      6a 04                   push   $0x4 1b: 58 pop %eax 1c: cd 80 int$0x80
1e:      c3                      ret


Main differences between this one and grc's version: mine makes no assumption of prior register contents, works in both x86 and x86_64 modes and does a ret in lieu of a sys_exit() syscall.

If you want to Try it online!, compile and run the following C program.

const char main[]="\xe8\r\0\0\0Hello, World!Yj\1[j\rZj\4X\xcd\x80\xc3";

• The difference is that yours is a function, @grc's is code that only works from _start in a static executable (where Linux does give you zeroed registers), and runs sys_exit when it's done. (And BTW, this won't work in 64-bit PIE executables (so your sample caller fails on many recent Linux distros where gcc -pie is the default, or any other context where the code is outside the low 32 bits. int 0x80 truncates pointers to 32 bits) – Peter Cordes Apr 13 '18 at 4:31
• If you make position-dependent code, you could use mov $msg, %ecx (5 bytes) instead of call/pop. Put msg after the ret in your function. You can also save instructions (but not code size) by using lea 3(%ebx), %eax (3 bytes) instead of push/pop, after getting a known value of ebx=1. (Still portable between ia32 and x86-64 with the same machine code, because lea 3(%rbx),%eax is safe. Tips for golfing in x86/x64 machine code). Other than position-dependent mov r32, imm32, I don't see a way to make this shorter. – Peter Cordes Apr 13 '18 at 4:36 • Here's a 30-byte version godbolt.org/g/xAcGMg (position-dependent, and avoiding push/pop in favour of xor-zero/inc and LEA). Note that as a function, it clobbers EBX, thus violating the standard calling convention. That's fine for asm functions, though, but maybe something to mention when you're showing how to use it as a C main. The CRT code that calls main doesn't actually break if main clobbers EBX on my system, last I checked, but it could. – Peter Cordes Apr 13 '18 at 4:46 • *window subsystem for linux – ASCII-only Apr 17 '18 at 11:10 # 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  # Rockstar, 21 bytes Shout "Hello, World!"  Yeah, kinda boring... oh well. • You can save 2 bytes by using Say instead of Shout. – RamenChef Sep 27 '18 at 13:58 # 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 – ASCII-only Dec 26 '18 at 0:10 # ESOPUNK, 191 COPY 72 #STDO COPY 101 #STDO COPY 108 #STDO COPY 108 #STDO COPY 111 #STDO COPY 44 #STDO COPY 32 #STDO COPY 119 #STDO COPY 111 #STDO COPY 114 #STDO COPY 108 #STDO COPY 100 #STDO COPY 33 #STDO  Can probably save some bytes by copying a constant to X, and ADDI/SUBI from it. # Pixiedust, 153 bytes ++.*+..+... ++.*++..+.+ ++.*++.++.. ++.*++.++.. ++.*++.++++ ++.*+.++.. ++.*+..... ++.*+.+.+++ ++.*++.++++ ++.*+++..+. ++.*++.++.. ++.*++..+.. ++.*+....+  Try it online! ## Explanation Each line of the program is: • ++ indicating that this line prints the following to STDOUT; • .*, the portal register indicating a number literal; and • A sequence of + and . characters forming the binary representation of the character to be printed. # Kitten, 18 bytes "Hello, World!"say  # Alchemist, 24 22 bytes _->Out_"Hello, World!"  Try it online! # Grocery List, 94 bytes H w nnn d v d v l c u v r v o c u v W nn c c m c m m w nnn c m d nnnn m b b c v e v H l p e t  • Could you please link to the interpreter you used to test this? – Dennis Jan 2 '19 at 12:34 • From the challenge spec: Note that there must be an interpreter so the submission can be tested. The only interpreter I know of is this one, but your program just prints H in it. – Dennis Jan 2 '19 at 12:59 • fixed, but space can't print – u-ndefined Jan 2 '19 at 13:29 • The output looks fine now, but the program seems to exit by popping from an empty stack and the challenge says The program must not write anything to STDERR. – Dennis Jan 2 '19 at 13:40 # Tamsin, 27 20 bytes main='Hello, World!'.  This is an interesting language. # Bitwise Cyclic Tag But Way Worse, 324 bytes 1111111111111111111111111111111111111111111111111111111110110101101010101110101101101110111010101110111010101110111110101101110101010110101010101011011011110111011111011110101101011101110101011101011010101011010101011n0200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000  Try it online! # legit, 1 commit, 67 bytes (commit messages), 179 + 3 = 182 bytes (repository) Commit tree: * 63c5d78 "!dlroW ,olleH" put put put put put put put put put put put put put  The program is quite boring -- commits are expensive, and the messages are compressed, so there's little incentive to use proper control flow. The program in its proper representation consists of 4 files: .git/HEAD (21 bytes, an empty file here is still accepted by the interpreter, but git does not recognize the repository): ref:refs/heads/master  .git/refs/heads/master (40 bytes): 63c5d7873f5b0ede65885bfdfd5c935827d6752a  .git/objects/4b/825dc642cb6eb9a060e54bf8d69288fbee4904 (15 bytes, xxd): 00000000: 78da 2b29 4a4d 5530 6000 000a 2c02 01 x.+)JMU0...,..  .git/objects/63/c5d7873f5b0ede65885bfdfd5c935827d6752a (103 bytes, xxd): 00000000: 78da 04c1 4501 c030 0c00 c0bd a722 0e4a x...E..0.....".J 00000010: 4137 6366 f0df bbf6 dcf7 f983 80a1 f89e A7cf............ 00000020: be07 6c34 52d7 32c6 b6e1 beb1 dab3 ef09 ..l4R.2......... 00000030: 9b41 3bb6 a83a 347d 8fe6 b1ac ff6f 3a1f .A;..:4}.....o:. 00000040: f090 6763 c705 31a4 2415 cae5 5252 4cc9 ..gc..1.$...RRL.
00000050: 29ca 0f57 d0c9 cfc9 49f5 5052 2828 2d21  )..W....I.PR((-!
00000060: 1503 00bd ca30 75                        .....0u

• hmm seems like you should measure repository size using a tar instead? – ASCII-only May 4 '19 at 1:01
• @ASCII-only Is there precedent for this? Also, tar on my machine always creates at least 10240-byte files minimum, which removes almost all possibilities for golfing. Moreover, the filenames literally can't store any extra information - they are hashes of the content (after decompressing with zlib). – NieDzejkob May 4 '19 at 7:59
• hmm. well the structure needs to be counted somehow. maybe some kind of tar archive instead? – ASCII-only May 4 '19 at 10:04
• @ASCII-only I've found the relevant meta post for multi-file programs and linked it in the header of my answer. Can you take a look? – NieDzejkob May 4 '19 at 10:07
• Looks fine now, but still feel like that's a bit hacky (e.g. it's impossible to make it work with 1-byte filenames) :/ IMO the best way to do this would be to count the bytes of a shell script to create the appropriate structure – ASCII-only May 4 '19 at 10:10

# 32 bit SPARC machine language on SunOS, 48 45 bytes

0x00:  40 00 00 02    call 0x8            ! PC relative jump, return addr to %o7
0x04:  82 10 20 04    mov  4, %g1         ! delay slot; select write() syscall
0x08:  90 10 20 01    mov  1, %o0         ! stdout is fd=1
0x0c:  92 03 E0 20    add  %o7, 32, %o1   ! put addr of string in %o1
0x10:  94 10 20 0d    mov  13, %o2        ! length of string
0x14:  91 D0 20 08    ta   %icc, %g0 + 8  ! call write()
0x18:  82 10 20 01    mov  1, %g1         ! select exit() syscall
0x1c:  91 D0 20 08    ta   %icc, %g0 + 8  ! call exit()
0x20:  48 65 6c 6c    "Hello, World!"
6f 2c 20 57
6f 72 6c 64
21


Porting to 64 bit SPARC requires changing the argument of the trap instruction from 8 to 64.

To try this on a SunOS machine, compile and run the following C program.

const char main[]="\x40\x00\x00\x02\x82\x10\x20\x04\x90\x10\x20\x01\x92\x03\xe0\x20\x94\x10\x20\x0d\x91\xd0\x20\x08\x82\x10\x20\x01\x91\xd0\x20\x08Hello, World!";


# VBA, 15

?"Hello, World!


Try it, for instance, in the "Immediate" panel of the development window in MS Excel.

• I see. I'll try Brandy – Beta Decay Aug 28 '15 at 15:01
• Nope, returns with "Type mismatch: number wanted" – Beta Decay Aug 28 '15 at 15:01
• @BetaDecay I can post a screenshot if you like – Jerry Jeremiah Aug 30 '15 at 23:05
• @edc65 This still works (least in my VBA7 version) if you remove the trailing quote saving you 1 byte: ?"Hello, World! – i_saw_drones May 7 '19 at 21:21
• @i_saw_drones amazing! VBA is really forgiving (or really a mess). Thanks for the hint – edc65 May 8 '19 at 14:15

# Turing Machine But Way Worse, 853 bytes

0 0 0 1 1 0 0
0 1 1 1 2 0 0
0 2 0 1 3 0 0
0 3 0 1 4 0 0
0 4 1 1 5 1 0
0 5 1 1 6 0 0
0 6 0 1 7 0 0
0 7 1 0 8 0 0
0 8 0 0 9 0 0
1 9 1 0 a 0 0
1 a 0 0 b 0 0
0 b 0 0 c 0 0
0 c 1 1 d 1 0
0 d 0 1 e 0 0
0 e 1 1 f 0 0
1 f 1 1 g 0 0
0 g 0 1 g 0 0
1 g 0 0 h 1 0
0 h 0 1 i 1 0
0 i 1 0 i 0 0
1 i 1 1 j 1 0
1 j 1 1 k 0 0
1 k 1 1 l 0 0
0 l 0 1 m 0 0
0 m 0 1 n 0 0
0 n 1 1 o 0 0
0 o 0 1 p 0 0
0 p 1 1 q 0 0
0 q 1 0 r 1 0
1 r 0 1 s 0 0
1 s 0 1 t 1 0
0 t 0 1 u 0 0
0 u 1 0 v 0 0
0 v 0 0 v 0 0
1 v 1 0 w 0 0
0 w 0 0 w 0 0
1 w 1 0 x 0 0
1 x 1 0 x 0 0
0 x 1 1 y 0 0
1 y 0 0 z 0 0
1 z 1 0 A 0 0
1 A 0 1 B 1 0
1 B 0 1 C 0 0
0 C 1 0 D 0 0
0 D 0 0 E 0 0
0 E 1 1 F 1 0
0 F 1 1 G 0 0
1 G 0 1 G 0 0
0 G 0 0 H 0 0
0 H 0 0 I 0 0
0 I 1 0 J 1 0
0 J 1 0 J 0 0
1 J 0 1 K 0 0
1 K 1 1 K 0 0
0 K 0 0 L 0 0
1 L 0 0 M 1 0
1 M 1 0 N 0 0
1 N 0 1 O 1 0
1 O 0 1 P 0 0
0 P 0 1 P 0 0
1 P 1 1 P 1 1


Try it online!

## Nandy, 159B

Simply sets the stack to bits 0 and 1 and then puts them in the output stack.

o::#o>oo>o>oooo>oo>oo>o>o>o>o>oo>o>oo>ooo>oo>o>oo>ooo>oo>o>oooo>oo>o>o>oo>oooo>o>oooooo>o>o>o>o>ooo>o>oo>o>oooo>o>ooo>oo>o>oo>oo>o>oo>ooo>oo>oo>o>oooo>o>oooo>o

• Wow, I'm surprised anyone noticed this language. This can probably be golfed quite a lot if you use a loop to output at the end – EdgyNerd Aug 31 '19 at 12:51
• But how? Can you present you program? (I actually found your language by looking at your TIO request.) – user85052 Aug 31 '19 at 13:15
• I don't think using a loop at the end would be any shorter since it would be the same amount of bytes to output as it is to dupe a bit – Jo King Sep 8 '19 at 8:11

# 1+, 87 83 bytes

11+""+"""+"/*^/"\+""+";\\+"*"1+;/+""";;(|1+1+1+)";/^""1()"+()+"1+";+^;;\";();/;;1+;


Try it online!

This should be very golfable, but it is hard to golf 1+ directly.

• Nice! I'm doing nothing now. – null Oct 9 '19 at 9:56

# CRPL and its sister language PRPL, 21 bytes

Bit of an obscure language, but the official tutorial doesn't contain a Hello World program so this at least is worth something.

"Hello, World!" Trace


"Hello, World!" pushes the string Hello, World! to the stack, and Trace pops an item from the stack and add it to the trace log, the closest thing the language has to SDTOUT or a console.

Alas, for this language is too obscure for Dennis's gadget; however, I have written the following interpreter in JS with all the complexity needed for this demo. I may one day make it support more.

var code = '"Hello, world!" Trace';
var stack = [];
var vars = Object.create(null);

var literals = [];
code = code.replace(/"(.*?)"/g, (m, $1) => 'lit' + [literals.length, literals.push($1)][0]).split(/\s/);

for (var token of code) {
if (token.match(/^lit(\d+)$/)) { stack.push(literals[token.slice(3)]); } else if (token.match(/^-?\d+.?\d*/)) { stack.push(+token); } else if (token.startsWith('<-')) { stack.push(vars[token.slice(2)]); } else if (token.startsWith('->')) { vars['v' + token.slice(2)] = stack.pop(); } else { switch(token) { case 'Trace5': console.log(stack.pop()); case 'Trace4': console.log(stack.pop()); case 'Trace3': console.log(stack.pop()); case 'Trace2': console.log(stack.pop()); case 'Trace': console.log(stack.pop()); break; default: throw new Error(token + 'is not implemented.'); } } } • No language is too obscure, you just have to ask for it on talk.tryitonline.net lol – ASCII-only Apr 11 '18 at 6:34 • Yeah probably. You could've just edited it yourself. – Nissa Dec 6 '19 at 22:54 # Ral, 103 bytes What better way to introduce a new language than by posting the 768th "Hello, World!"? Hand-made code, can probably be improved a lot. 11+:+:+:0=1+:+:+::+:.+0*/-::1+.0*+:::..1+1+1+::.0*:+:+:11+1+:+:++..10*1+1+1+:+:+:+-..1+1+1+...0*:+:+1+.  Try it online! • Cool language! I like the mix of stack and random access. – Redwolf Programs Apr 12 '20 at 23:25 ## Spice, 20 bytes @OUT "Hello, World!"  ## Explanation Should be pretty straight forward what's happening, but we use some undefined behaviour to shave off 2 bytes (interpreter version 1.1.0.0, which is current at time of submission). The program should read: ;@ OUT "Hello, World!";  as per the spec, but we drop the ; as we only have one instruction and don't need to define an instruction separator, and so also have no trailing ; at the end. # Symbolic Raku, 34 bytes $_='(%,,/ @)/),$!'~^'@@@@ ~@[@@'  Try it online! My newest language, though it's not too original. This is inspired by FlipTack's Symbolic Python, which bans the use of alphanumeric characters, but otherwise executes as Python code. In this case, I've used the language Raku (previously known as Perl 6), which takes input through the $_ and similarly outputs it's contents at the end of execution. Symbolic Raku does not have an extra eval operator like Symbolic Python, but it is still Turing complete through the other operators and symbols that Raku provides.

In this case, we use the string xor operator (~^), which takes two strings to produce the string Hello, World!, which is obviously banned from hardcoding because it contains letters. A shortcut for producing these strings is included in the reference implementation through the -g=string flag. Currently, this is not yet on TIO, so the link goes to the Raku language instead.

# Wd, 12 10 bytes (SBCS)

.s*♪╧T≈╪√ù


## Explanation

This program is a compressed program. After decompression this becomes:

J=QwTI[5mRb


After string-decompression:

Hello, World!"


After quote auto-completion:

"Hello, World!"


After which it is implicitly output.

# Roj, 18 bytes

I love this simple BASIC dialect ...

out"Hello, World!"


# Explanation

out                $Output$
"Hello, World!" $the string "Hello, World"$


# Arn, 6 bytes

'Mh└a└


# Explanation

Unpacked:

'yt, bs!


A compressed string where every word is capitalized. Output is implicit

# CSS, 62 bytes:

*{display:none}html{display:flex}:after{content:'Hello World!'


This is the first pure CSS on here, I think.

# MAWP, 86 62 bytes

89W!;74WM1M!;7M!!;;3M;66W8M;84W;99W6M!;64WM!;3M!;6A!;8A;66W3A;


Try it!

• 64 bytes – Lyxal Aug 14 '20 at 21:32