523
\$\begingroup\$

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 */

var answers = [], answers_hash, answer_ids, answer_page = 1, more_answers = true, comment_page;

function answersUrl(index) {
  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;
}

function getAnswers() {
  jQuery.ajax({
    url: answersUrl(answer_page++),
    method: "get",
    dataType: "jsonp",
    crossDomain: true,
    success: function (data) {
      answers.push.apply(answers, data.items);
      answers_hash = [];
      answer_ids = [];
      data.items.forEach(function(a) {
        a.comments = [];
        var id = +a.share_link.match(/\d+/);
        answer_ids.push(id);
        answers_hash[id] = a;
      });
      if (!data.has_more) more_answers = false;
      comment_page = 1;
      getComments();
    }
  });
}

function getComments() {
  jQuery.ajax({
    url: commentUrl(comment_page++, answer_ids),
    method: "get",
    dataType: "jsonp",
    crossDomain: true,
    success: function (data) {
      data.items.forEach(function(c) {
        if (c.owner.user_id === OVERRIDE_USER)
          answers_hash[c.post_id].comments.push(c);
      });
      if (data.has_more) getComments();
      else if (more_answers) getAnswers();
      else process();
    }
  });  
}

getAnswers();

var SCORE_REG = (function(){
  var headerTag     = String.raw `h\d`
  var score         = String.raw `\-?\d+\.?\d*` // with negative/floating-point support
  var normalText    = String.raw `[^\n<>]*` // no HTML tag, no newline
  var strikethrough = String.raw `<s>${normalText}</s>|<strike>${normalText}</strike>|<del>${normalText}</del>`
  var noDigitText   = String.raw `[^\n\d<>]*`
  var htmlTag       = String.raw `<[^\n<>]+>`

  return new RegExp(
  String.raw  `<${headerTag}>`+
  String.raw    `\s*([^\n,]*[^\s,]),.*?`+
  String.raw    `(${score})`+
  String.raw    `(?=`+
  String.raw      `${noDigitText}`+
  String.raw      `(?:(?:${strikethrough}|${htmlTag})${noDigitText})*`+
  String.raw      `</${headerTag}>`+
  String.raw    `)`
  );
})();

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

function getAuthorName(a) {
  return a.owner.display_name;
}

function process() {
  var valid = [];
  
  answers.forEach(function(a) {
    var body = a.body;
    a.comments.forEach(function(c) {
      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],
        link: a.share_link,
      });
    
  });
  
  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;
    
    var answer = jQuery("#answer-template").html();
    answer = answer.replace("{{PLACE}}", lastPlace + ".")
                   .replace("{{NAME}}", a.user)
                   .replace("{{LANGUAGE}}", a.language)
                   .replace("{{SIZE}}", a.size)
                   .replace("{{LINK}}", a.link);
    answer = jQuery(answer);
    jQuery("#answers").append(answer);

    var lang = a.language;
    lang = jQuery('<i>' + a.language + '</i>').text().toLowerCase();
    
    languages[lang] = languages[lang] || {lang: a.language, user: a.user, size: a.size, link: a.link, uniq: lang};
  });

  var langs = [];
  for (var lang in languages)
    if (languages.hasOwnProperty(lang))
      langs.push(languages[lang]);

  langs.sort(function (a, b) {
    if (a.uniq > b.uniq) return 1;
    if (a.uniq < b.uniq) 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)
                       .replace("{{LINK}}", lang.link);
    language = jQuery(language);
    jQuery("#languages").append(language);
  }

}
body { text-align: left !important}

#answer-list {
  padding: 10px;
  float: left;
}

#language-list {
  padding: 10px;
  float: left;
}

table thead {
  font-weight: bold;
}

table td {
  padding: 5px;
}
<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/primary.css?v=f52df912b654">
<div id="language-list">
  <h2>Winners by Language</h2>
  <table class="language-list">
    <thead>
      <tr><td>Language</td><td>User</td><td>Score</td></tr>
    </thead>
    <tbody id="languages">

    </tbody>
  </table>
</div>
<div id="answer-list">
  <h2>Leaderboard</h2>
  <table class="answer-list">
    <thead>
      <tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr>
    </thead>
    <tbody id="answers">

    </tbody>
  </table>
</div>

<table style="display: none">
  <tbody id="answer-template">
    <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td><a href="{{LINK}}">{{SIZE}}</a></td></tr>
  </tbody>
</table>
<table style="display: none">
  <tbody id="language-template">
    <tr><td>{{LANGUAGE}}</td><td>{{NAME}}</td><td><a href="{{LINK}}">{{SIZE}}</a></td></tr>
  </tbody>
</table>

\$\endgroup\$
22
  • 4
    \$\begingroup\$ @isaacg No it doesn't. I think there would be some interesting languages where it's not obvious whether primality testing is possible. \$\endgroup\$ Commented Aug 28, 2015 at 13:56
  • 7
    \$\begingroup\$ If the same program, such as "Hello, World!", is the shortest in many different and unrelated languages, should it be posted separately? \$\endgroup\$ Commented Aug 28, 2015 at 15:33
  • 2
    \$\begingroup\$ @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. \$\endgroup\$ Commented Aug 28, 2015 at 19:34
  • 8
    \$\begingroup\$ @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. \$\endgroup\$ Commented Aug 29, 2015 at 23:01
  • 2
    \$\begingroup\$ @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. \$\endgroup\$
    – user202729
    Commented May 20, 2018 at 10:20

1000 Answers 1000

1
18 19
20
21 22
34
2
\$\begingroup\$

FROM HERE TO THERE, 27 bytes

FROM "Hello, World!" TO OUT

Try it online!

\$\endgroup\$
2
\$\begingroup\$

JavaScript, 101 85 80 bytes

Thanks to @Redwolf Programs for removing 21 bytes

console.log(String.fromCharCode(72,101,108,108,111,44,32,87,111,114,108,100,33))

Try It Online!

\$\endgroup\$
3
  • \$\begingroup\$ But there is shortest JavaScrpit answer. we allow duplicates. \$\endgroup\$
    – Fmbalbuena
    Commented Nov 24, 2021 at 16:11
  • \$\begingroup\$ You can do String.fromCharCode(...array) to join all the characters into a string, saving a lot of bytes \$\endgroup\$
    – rydwolf
    Commented Nov 24, 2021 at 16:16
  • \$\begingroup\$ Oh, since you're not doing any preprocessing on the array now, you don't even need .... You can just list the characters, so String.fromCharCode(72,101,108,...) \$\endgroup\$
    – rydwolf
    Commented Nov 24, 2021 at 16:23
2
\$\begingroup\$

Woodchuck, 1161 bytes

Woodchuck is a derivative of BF which uses binary trees. Here is the hello world program.

>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[^^<>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[^^<>>[>]>^<^[^]^>>[>]>^<^[^]^<>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^<>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^<>>[>]>^<^[^]^^^^^>>[>]%<%^[^]^>>]^^<>>[>]>^<^[^]^<>>[>]>^<^[^]^<>>[>]%<%^[^]^<<>>[>]>^<^[^]^>>[^^^>>]^^^>>[>]%<%^[^]^>>]^^<<>>[>>>[>]>^<^[^]^].^[^]^<>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>>>[>]>^<^[^]^].^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>>>[>]>^<^[^]^].^[^]^>>[>>>[>]>^<^[^]^].^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>>>[>]>^<^[^]^].^[^]^<<>>[>>>[>]>^<^[^]^].^[^]^^>>[>]%<%^[^]^>>[>>>[>]>^<^[^]^].^[^]^^>>[>>>[>]>^<^[^]^].^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>>>[>]>^<^[^]^].^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>>>[>]>^<^[^]^].^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>]%<%^[^]^>>[>>>[>]>^<^[^]^].^[^]^<<>>[>]>^<^[^]^>>[>>>[>]>^<^[^]^].^[^]^<>>[>]>^<^[^]^>>[>]>^<^[^]^>>[>>>[>]>^<^[^]^].^[^]^

Umm... That's quite complex. However, woodchuck is Turing complete, so...

\$\endgroup\$
2
\$\begingroup\$

Python is Magic, 2163 bytes

__builtins__.__getattribute__(__doc__.__repr__.__name__.__getitem__(__doc__.__class__.__class__.__name__.__len__()).__add__(__doc__.__str__.__name__.__getitem__(__doc__.__class__.__class__.__name__.__len__()).__add__(__name__.__len__().__class__.__name__)))(__builtins__.__getattribute__(__annotations__.__class__.__name__.__getitem__(__annotations__.__str__().__len__()).__add__(__doc__.__hash__.__name__.__getitem__(__annotations__.__str__().__len__()).__add__(__name__.__class__.__name__.__getitem__(__annotations__.__str__().__len__()))))(__name__.__len__().__mul__(__name__.__len__().__invert__().__neg__())).__add__(__doc__.__repr__.__name__.__getitem__(__name__.__class__.__name__.__len__()).__add__(__name__.__mul__.__name__.__getitem__(__doc__.__class__.__class__.__name__.__len__()).__mul__(__annotations__.__str__().__len__()).__add__(__doc__.__bool__.__name__.__getitem__(__name__.__class__.__name__.__len__()).__add__(__builtins__.__getattribute__(__doc__.__dir__().__class__.__name__)(__name__).__str__().__getitem__(__doc__.__class__.__class__.__name__.__len__()).__add__(__name__.__eq__.__doc__.__getitem__(__name__.__eq__.__name__.__len__()).__add__(__builtins__.__dir__().__getitem__(__name__.__class__.__name__.__len__().__mul__(__doc__.__class__.__class__.__name__.__len__().__mul__(__name__.__sizeof__.__name__.__len__()))).__getitem__(__doc__.__class__.__class__.__name__.__len__()).__add__(__doc__.__bool__.__name__.__getitem__(__name__.__class__.__name__.__len__()).__add__(__doc__.__str__.__name__.__getitem__(__doc__.__class__.__class__.__name__.__len__()).__add__(__name__.__mul__.__name__.__getitem__(__doc__.__class__.__class__.__name__.__len__()).__add__(__name__.__mod__.__name__.__getitem__(__doc__.__class__.__class__.__name__.__len__()).__add__(__builtins__.__getattribute__(__annotations__.__class__.__name__.__getitem__(__annotations__.__str__().__len__()).__add__(__doc__.__hash__.__name__.__getitem__(__annotations__.__str__().__len__()).__add__(__name__.__class__.__name__.__getitem__(__annotations__.__str__().__len__()))))(__name__.__class__.__name__.__len__().__mul__(__name__.__getitem__.__name__.__len__()))))))))))))))

Try it online!

To check if the code is valid then

import re, sys
allowed = r"A-Za-z().,_"
regex = r"(?:__)?([{}]+)(?:__)?".format(allowed)
banned = r"[^{}]".format(allowed)
script = input()

if re.findall(banned, script): 
    raise SyntaxError("Only letters, parenthesis, dot and underscore are allowed.")
print("Valid!")
\$\endgroup\$
4
  • 1
    \$\begingroup\$ 1311 bytes \$\endgroup\$ Commented Dec 20, 2021 at 19:43
  • \$\begingroup\$ @grandBagel Why? \$\endgroup\$
    – Fmbalbuena
    Commented Dec 20, 2021 at 20:33
  • \$\begingroup\$ It seems like you've copied this directly from the esolangs page without any modifications (such as the trivial one that @grandBagel points out). This isn't disallowed per se, but you should try to optimise for bytes in code-golf \$\endgroup\$
    – Jo King
    Commented Dec 20, 2021 at 21:44
  • \$\begingroup\$ @BgilMidol Here it is with a working interpreter \$\endgroup\$
    – DLosc
    Commented Feb 3, 2022 at 16:55
2
\$\begingroup\$

Lexurgy, 23 bytes

For a tool meant for handling strings, it's surprisingly lengthy to output any string longer than 1 or 2 characters without any input.

a:
*=>Hello\,\ World\!
\$\endgroup\$
2
\$\begingroup\$

Seriously, 1 byte

H

Try it online!

\$\endgroup\$
1
  • 1
    \$\begingroup\$ Time for the "Seriously?" joke. \$\endgroup\$ Commented Feb 3, 2022 at 14:33
2
\$\begingroup\$

Lean, 22 bytes

#print "Hello, World!"

Try it online!

Shouldn't be on this list at the moment!

\$\endgroup\$
2
  • \$\begingroup\$ Why shouldn't it be on the list at the moment? \$\endgroup\$ Commented Feb 18, 2022 at 0:30
  • \$\begingroup\$ Well, it wasn't until now, was it? \$\endgroup\$ Commented Feb 18, 2022 at 0:42
2
\$\begingroup\$

Python, 22 Bytes

In Python, this is pretty straight-forward:

print("Hello, World!")

This is equivalent to

import sys
sys.stdout.write("Hello, World!")

which is 44 bytes.

If you are in the interpreter, "Hello World" would return itself, but I doubt it goes to sys.stdout.

\$\endgroup\$
3
  • 1
    \$\begingroup\$ Welcome to Code Golf! This site is for competitive programming, so answers should include a byte count rather than just solving the problem. \$\endgroup\$
    – rydwolf
    Commented Feb 3, 2022 at 6:08
  • 1
    \$\begingroup\$ See Blue's solution, same code, so same byte count. Anyway, if you include a link to TIO like this: Try it online!, there it tells you the byte count: “22 chars, 22 bytes (UTF-8)”. \$\endgroup\$
    – manatwork
    Commented Feb 3, 2022 at 6:20
  • 9
    \$\begingroup\$ I don't think this answer deserves three downvotes. It's a duplicate, but those are explicitly allowed under site rules. It didn't have a byte count at first, but this is a new user and it's not uncommon for people to not be sure how the byte counts work at first. It made effort to explain how the answer works, which is already more effort shown than a good 80% of the answers on this challenge. \$\endgroup\$
    – rydwolf
    Commented Feb 3, 2022 at 17:41
2
\$\begingroup\$

QWERTY, 1 byte

q

QWERTY is a work-in-progress language by me, written in C++. The letters in the word QWERTY will be used in the most trivial programs, however, it will be Turing-complete and hopefully not a tarpit.

Eh, but that's cheap.

QWERTY(non-cheap, charmode), 37 bytes

'Ho'eo'loo'oo',o' o'Wo'oo'ro'lo'do'!o

Yep, it's that bad.

QWERTY(stringmode), 28 bytes

"!dlroW ,oleH"(ddodddddddddd

About 2/3 as good :(

QWERTY(optimized stringmode), 16 bytes

"!dlroW ,olleH"s

Now it looks like every other golfing language.

If you wish to see this example, for some reason, take this link: QWERTY

\$\endgroup\$
2
\$\begingroup\$

99, 283 bytes

Yes there is a language called 99

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

Try it online!

\$\endgroup\$
2
\$\begingroup\$

Bit, 637 bytes

BIT 0
BIT 0
BIT 0
BIT 1
BIT 0
BIT 0
BIT 1
BIT 0
BIT 1
BIT 0
BIT 1
BIT 0
BIT 0
BIT 1
BIT 1
BIT 0
BIT 0
BIT 0
BIT 1
BIT 1
BIT 0
BIT 1
BIT 1
BIT 0
BIT 0
BIT 0
BIT 1
BIT 1
BIT 0
BIT 1
BIT 1
BIT 0
BIT 1
BIT 1
BIT 1
BIT 1
BIT 0
BIT 1
BIT 1
BIT 0
BIT 0
BIT 0
BIT 1
BIT 1
BIT 0
BIT 1
BIT 0
BIT 0
BIT 0
BIT 0
BIT 0
BIT 0
BIT 0
BIT 1
BIT 0
BIT 0
BIT 1
BIT 1
BIT 1
BIT 0
BIT 1
BIT 0
BIT 1
BIT 0
BIT 1
BIT 1
BIT 1
BIT 1
BIT 0
BIT 1
BIT 1
BIT 0
BIT 0
BIT 1
BIT 0
BIT 0
BIT 1
BIT 1
BIT 1
BIT 0
BIT 0
BIT 0
BIT 1
BIT 1
BIT 0
BIT 1
BIT 1
BIT 0
BIT 0
BIT 0
BIT 1
BIT 0
BIT 0
BIT 1
BIT 1
BIT 0
BIT 1
BIT 0
BIT 0
BIT 0
BIT 0
BIT 1
BIT 0
BIT 0
BYTES 8
PRINT

You heard me right, 637 bytes

-8 thx to mathcat

Try it online!

\$\endgroup\$
1
  • \$\begingroup\$ You don't need println \$\endgroup\$
    – math scat
    Commented Feb 27, 2022 at 12:04
2
\$\begingroup\$

Binary Lambda Calculus, 14 bytes (30 chars)

Hexdump:

0:2a48656c6c6f2c20576f726c6421

Try it online!

\$\endgroup\$
3
  • 1
    \$\begingroup\$ What you have posted is a hexdump of the actual program. The program itself is 14 bytes. (it looks like TIO's byte counter for hexdumps is broken) \$\endgroup\$
    – pxeger
    Commented Feb 28, 2022 at 10:49
  • \$\begingroup\$ Ah ic thx pxeger pls edit my post if i edited it wrongly thx u know more than me! \$\endgroup\$
    – DialFrost
    Commented Feb 28, 2022 at 11:02
  • \$\begingroup\$ No need for a hexdump; as shown at ioccc.org/2012/tromp/hint.html, any character from ASCII 32 (space) through 47 (/) in front of the string will do, e.g. *Hello, World! \$\endgroup\$
    – John Tromp
    Commented Oct 21 at 14:52
2
\$\begingroup\$

Etch, 20 bytes

New language! :D

:out"Hello, World!";

\$\endgroup\$
2
\$\begingroup\$

Fennel, 22 bytes

(print"Hello, World!")

¯1 byte thanks to @ovs

\$\endgroup\$
2
  • \$\begingroup\$ I think you can omit the space. At least that works with the REPL on the website \$\endgroup\$
    – ovs
    Commented Mar 30, 2022 at 7:35
  • \$\begingroup\$ @ovs yep that works \$\endgroup\$
    – zoomlogo
    Commented Mar 30, 2022 at 8:11
2
\$\begingroup\$

Makina, 19 bytes

New language! :D

P
>t:Hello, World!;
\$\endgroup\$
2
\$\begingroup\$

EEL - 86 Bytes

=72 !>=101 !>=108 !>=108 !>=111 !>=44 !>=32 !>=87 !>=111 !>=114 !>=108 !>=100 !>=33 !.

Explanation

EEL (Easy Esoteric Lang) is an esoteric programming language created by me, easy to manage, hence the name. Below is a brief description of the language.

.-EEL is based on a vector of bytes initialized to zero, on which basic arithmetic operations can be performed, whose length is equal to 64Kb.

.-EEL allows the reading and writing of one byte at a time in the form of an ASCII character in the standard input and output respectively.

.-EEL has a brief help section which can be viewed from the interpreter.

.-EEL is extremely sensitive, so a wrong input byte can cause a wrong output.

.-EEL does not have an error/exception handling system, so it may crash unexpectedly if a fatal error such as division by zero occurs.

Defined operations:

=000 -> Copy the value of number 000 to the current byte.

+000 -> Add to the current byte, the value of number 000.

-000 -> Subtract to the current byte, the value of number 000.

*000 -> Multiply to the current byte, the value of number 000.

/000 -> Divide to the current byte, the value of number 000 (cannot be zero).

%000 -> Calculate the modulo of the current byte and the value of number 000 (cannot be zero).

> -> Go to the next byte of the vector.

< -> Go to the previous byte of the vector.

? -> Read a ASCII character from STDIN and assign it to current byte.

! -> Write to current byte in STDOUT as an ASCII character.

: -> Open/close the space for comments.

. -> Exit the program.

$ -> Reference to current byte.

NOTES:

The 000 number can be s current byte reference operator ($).

The 000 number (x) must be an integer number, such 0 < x <= 255.

There must be a space character u+0020 after each number 000.

Try the EEL interpreter!

\$\endgroup\$
2
\$\begingroup\$

MSWLogo, 16 bytes

pr[Hello, World!

Picture to prove it works

\$\endgroup\$
2
\$\begingroup\$

A very long language name that is very weird and yeah, this is your but its this, 80 bytes.

A very long language name that is very weird and yeah, this is your but its this
\$\endgroup\$
2
\$\begingroup\$

A Language Programmed While Listening to Godspeed You! Black Emperor, 93 bytes

charms 72. 101. 108. 108. 111. 44. 32. 119. 111. 114. 108. 100. 33. 10﹔
print﹔
give up﹔

This is an esolang, and the goal of the language was to make it as annoying as possible to program.

\$\endgroup\$
2
\$\begingroup\$

Perhaps --verbose, 14 bytes

"Hello, World!
\$\endgroup\$
2
  • 1
    \$\begingroup\$ Perhaps this will be the first of many Perhaps answers. :p \$\endgroup\$
    – lyxal
    Commented Jun 25, 2022 at 9:15
  • \$\begingroup\$ \$\endgroup\$ Commented Jun 25, 2022 at 9:17
2
\$\begingroup\$

Knight, 16 bytes

O"Hello, World!"
\$\endgroup\$
2
\$\begingroup\$

Cognate, 20 bytes

Print"Hello, World!"

Attempt This Online!

\$\endgroup\$
2
\$\begingroup\$

Gaia, 14 bytes

“Hello, World!

Try it online!

Strange that there wasn't a Gaia answer to this challenge yet, given that there's so many answers.

\$\endgroup\$
2
\$\begingroup\$

Functional(), 139 129 bytes

0,1,=,:(W,& a(>(a(:(Z,&()(W()0)))),W))0 Z Z()1()1 W()W()>()W()>()> >()>()W()1()0()0()Z W 1()1()1()> >()> Z W 1()W()>()Z W()1()0 Z

Try it online!
Try the 139B version online!

\$\endgroup\$
2
\$\begingroup\$

HP User RPL, 14 bytes

Thanks Corvalis

"Hello, World!"
\$\endgroup\$
2
\$\begingroup\$

Rol, 24 bytes

println("Hello, World!")

Rol is a new language I'm creating for the purposes of replacing Lua (because who likes Lua). I was gonna post this when the language was much more mature but I felt like reworking the CLI so I added an interpreter mode. That means you don't have to mess around with the stdlib and Lua linking and whatnot.

Once you download the jar from the releases, run it like this:

java -jar Rol-<version>.jar -i <input file>

Make sure -i is added otherwise it'll spit out a compiled Lua file.

\$\endgroup\$
2
\$\begingroup\$

Axo, 29 bytes

"!dlroW ,o%
\%#[<"Hell<
 >( ^

Please let me know if this can be golfed further.

\$\endgroup\$
4
  • \$\begingroup\$ Another 29 byte solution: "!dlroW ,olleH"(((((((((((((\ \$\endgroup\$
    – MilkyWay90
    Commented Feb 6, 2019 at 3:42
  • 1
    \$\begingroup\$ You may want to consider putting in a TIO link to make it more accessible for others to test it \$\endgroup\$
    – MilkyWay90
    Commented Apr 21, 2019 at 22:50
  • 1
    \$\begingroup\$ On the first line, the comma should be after the space, as currently this outputs "Hello ,World!" rather than "Hello, World!" \$\endgroup\$ Commented Apr 13, 2023 at 16:24
  • 1
    \$\begingroup\$ @Jacob Good catch, thank you! \$\endgroup\$ Commented Apr 20, 2023 at 3:43
2
\$\begingroup\$

hyperscript, 27 24 bytes

init log 'Hello, World!'

<script src="https://unpkg.com/[email protected]"></script>
<script type="text/hyperscript">

init log 'Hello, World!'

</script>

Calls the log command when the document is initialized.

\$\endgroup\$
2
\$\begingroup\$

Thunno 2, 2 bytes

kH

Attempt This Online!

Polyglots with Vyxal. Constant for "Hello, World!".

Thunno 2, 8 bytes

’Ƙ¥, «ʋ!

Attempt This Online!

Dictionary compressed string.

\$\endgroup\$
2
\$\begingroup\$

Vyxal, 10 bitsv1, 1.25 bytes

kH

Try it Online!

Pushes the string "Hello, World!"

Alternatively,

Vyxal, 50 bitsv1, 6.25 bytes

`ƈṡ, ƛ€!

Try it Online!

\$\endgroup\$
2
1
18 19
20
21 22
34

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.