Hello ASCII World!

Question

Construct a full program which outputs Hello, World!. The score of your submission will be equal to the sum of all of the ASCII values of the distinct characters. The lowest score wins!

Rules

It must be a full program which takes no input
It must only print to STDOUT, nothing else
It must be strictly less than 1000 bytes long
It may only include printable ASCII (meaning no \n allowed)
The objective is to find the lowest score for every language, so no answer will be marked "accepted"

Example

Here is an example submission in Python, which has a score of 1279:

print"Hello, World!"

Finally, here is a TIO link to score your submission.

This answer shows how to write any Python program using only exc="% (which would have a score of 452), but it would be insanely long without newline. — Surculose Sputum, Commented Mar 24, 2020 at 4:00
On further thought, the above scheme is impossible without newline :( — Surculose Sputum, Commented Mar 24, 2020 at 4:06
@SurculoseSputum This one uses 9 chars exc%'(1+), no newline. CJam can do it in just 3: ')~. — Bubbler, Commented Mar 24, 2020 at 4:12
Would it then be preferrable to include newlines, or maybe add a penalty for solutions which are too long? — dingledooper, Commented Mar 24, 2020 at 4:15
And if you won't change the text "Hello, World!", Stuck will win as always. — Bubbler, Commented Mar 24, 2020 at 4:31

Bubbler · Accepted Answer · 2020-09-10 01:32:56Z

C (gcc) `-zexecstack` `-Wl,-e$` `-nostartfiles` on Linux x86-64, 876 914 bytes, score 798 293

$=1111+1111+1111+111+111-11-11-11-11+1+1+1;$$=1111111111+111111111-11111111+1111111+1111111-111111+1111+1111+111+111+111+111+111-11-11-11-11+1+1+1+1+1;$$$=111111+111111-11111-1111+111+111+111-11-1-1-1-1-1;$$$$=111111111+111111111+11111111+11111111+11111111+1111111+1111111+111111-1111-1111-1111-1111-111-111-111+11+11+11+11+1+1+1+1+1;$$$$$=1111111111+1111111111-111111111-111111111-111111111-111111111+11111111+11111111+11111111+11111111-1111111-1111111-1111111-111111-111111-111111+11111+11111-1111+111+111+11+1;$$$$$$=111111111+111111111+111111111+111111111+111111111-11111111-1111111-1111111-1111111-1111111-111111-111111+1111+1111+1111+1111+1111-111-111-111+11+11-1-1;$$$$$$$=1111111111+1111111111-111111111-111111111-111111111-111111111+11111111+11111111+11111111+11111111-1111111-1111111-111111-111111-111111-111111-111111-1111-1111-1111-1111-1111+11+11+11+11+1;$$$$$$$$=11111-1111-1111-111-111-111-11+1+1+1;

Try it online!

Charset: ~~A[]={+,-1};~~ 1+-$=;

Same method as the previous answer, with even more hacking to supply a custom entry point named $ (which has the smallest ASCII value among a-zA-Z_$). Credit to this SO answer for identifying the flags and assembly setup to make this work. Also got a hint from ceilingcat's awesome linker hack to remove []{} from the code.

Assembly: (NASM syntax)

bits 64
global _start
_start:
  mov edx, 13
  pop rax
  push rax
  lea rsi, [rel s]
  pop rdi
  syscall
s: db "Hello, World!"

Uses the argc=1 set up on the stack to load the value 1 to rax and rdi. The instructions are slightly mixed up in order to get the minimal code length in C.

Here is the Python script that generates the "ones decomposition" from the xxd -i output (C include-style hex output) of the compiled binary.

C (gcc) `-zexecstack` on Linux x86-64, 891 bytes, score 1154

main[]={1111+1111+1111+111+111-11-11-11-11+1+1+1,1111111111-111111111-111111111+11111111-1111111-111111-111111-111111-111111+11111-1111-1111-1111-1111+111+111+111+11,1+1+1+1,111111111-11111111-11111111-1111111-1111111-1111111-1111111+111111+111111+111111+111111+11111+11111+11111+11111-111-111-111-111-111-11-11-11,1111111111+1111111111-111111111-111111111-111111111-111111111+11111111+11111111+11111111+11111111-1111111-1111111-1111111+111111+11111+11111+11111+11111-1111-111-111+11+11+11,1111111111+111111111+111111111+111111111+11111111+11111111-1111111-1111111-1111111-1111111-111111-111111-111111-111111-11111-11111-11111-11111-11111+1111+1111+1111+1111-111-111-111-11-1-1-1-1,1111111111+111111111+111111111+111111111+111111111+111111111+11111111+11111111-1111111-1111111-1111111-1111111+111111+111111+111111+11111+11111+11111+11111+11111-1111-1111-1111-1111-111+11-1-1-1-1-1,11+11+11};

Try it online!

Uses ceilingcat's minimal Turing-complete charset main[]={1+,};, plus - to meet the code length limit.

Assembly: (NASM syntax)

bits 64
global _start
_start:
  mov edx, 13
  lea rsi, [rel s]
  mov eax, edi
  syscall
s: db "Hello, World!"

Essentially calls write syscall once, and goes into arbitrary instructions formed by the string literal, causing segfault.

This is a brilliant solution (I’ve upvoted it). But I think the language should be "C (gcc)/x86". It won’t work using gcc on a non-x86 machine. — Mitchell Spector, Commented Mar 25, 2020 at 13:33
In fact, I just tried it on two x86 machines (one Linux and one OS X), and it failed to print "Hello, World!" on both. I don't know what the difference is between these and TIO, where it worked. — Mitchell Spector, Commented Mar 25, 2020 at 14:15
One more comment: This program writes an error message to stderr (when it crashes), which I understood wasn't allowed in OP's specs ("It must only print to STDOUT, nothing else"). I could reduce my dc score, for instance, if spurious output to stderr was allowed, and that's probably true of some of the other solutions as well. — Mitchell Spector, Commented Mar 25, 2020 at 14:29
@MitchellSpector This code is supposed to work in x86-64, with executable stack (-zexecstack flag in the compiler/linker). And as pointed out in the linked answer, you might need const in some environments. The error messages are printed by the OS, not the program. — Bubbler, Commented Mar 26, 2020 at 0:58
Thanks -- I missed that flag because it wasn't included with the language name in the answer heading, but it's clearly needed. That got it to work correctly on my Linux system. But I still can't get it to work under OS X, where I believe the equivalent compiler option is -Wl,-allow_stack_execute -- but even with that option, it doesn't print "Hello, World!". I tried it with and without the const keyword before main. If you know how to get this to work under OS X, I'd be interested. — Mitchell Spector, Commented Mar 26, 2020 at 1:54

Bubbler · Accepted Answer · 2020-03-24 04:30:21Z

CJam, 652 bytes, score 120

'))))))))))))))))))))))))))))))))')))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))'))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))'))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))')))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))'))))''(((((((')))))))))))))))))))))))))))))))))))))))))))))))')))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))'))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))'))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))'))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))''((((((

Try it online!

Uses ')(.

lyxal · Accepted Answer · 2020-03-24 04:41:53Z

5

Stuck, 0 bytes, score 0

An empty program prints "Hello, World!"

Just as suggested in the comments, Stuck wins!

edited Mar 24, 2020 at 4:41

answered Mar 24, 2020 at 4:36

lyxal

34.3k2 gold badges64 silver badges141 bronze badges

6

\$\begingroup\$ Can we please stop the low-effort stuff? 1+ though. \$\endgroup\$
– TwilightSparkle
Commented Sep 10, 2020 at 5:22
\$\begingroup\$ Also 0-byte: BrainCrash (2008) \$\endgroup\$
– 鳴神裁四点一号
Commented Sep 23 at 5:53

Add a comment |

StRaWbErRy · Accepted Answer · 2020-03-24 12:07:53Z

5

HQ9+, 1 byte, score 72

There is no TIO implementation for HQ9+.

answered Mar 24, 2020 at 12:07

StRaWbErRy

891 silver badge2 bronze badges

Add a comment |

ceilingcat · Accepted Answer · 2020-03-24 21:04:49Z

5

Malbolge, 71 bytes, 3963 points

(=<`#9]=}5YXy1Uvv-Q+q)Mn&Jk#j!EC$dc.?}_<)L'8%oXW2qj|Q@yx+iba'Hd]\E!YX|z

Try it online!

Uses the following unique characters

!#$%&'()+-.12589<=?@CEHJLMQUWXY\]_`abcdijknoqvxyz|}

edited Mar 24, 2020 at 21:04

answered Mar 24, 2020 at 20:50

ceilingcat

7,6552 gold badges30 silver badges30 bronze badges

Add a comment |

FarSeenNomic · Accepted Answer · 2020-12-15 08:25:05Z

Wolfram Language (Mathematica), 321 bytes, score 399

charset: \013456

\043\1333311\05313311\0531133\135\133\043\13311\0534011\0534031\135\133\043\1331343\05311354\135\13331\05341\054101\0544\053104\0544\053104\054111\05444\0541\05331\05443\05344\054111\054114\0544\053104\054100\05433\135\135\135\046\1330\133\1330\0540\135\135\133\116\141\155\145\163\133\135\133\133\043\135\135\135\046\135

Try it online!

I feel it's best to try to explain this one. First, Mathematica allows character inputs with octal triplets (From this point on, I'll be using my local copy), after decoding, looks like so

#[1000+31111][#[3304+11135][#[10000+13003][31+41,101,4+104,4+104,111,44,1+31,43+44,111,114,4+104,100,33]]]&[0[[0,0]][Names[][[#]]]&]

All of the addition is just to avoid getting a 2, 7, 8, or 9, which in octal have 2s and 7s, which are trivially avoidable, all the other characters are the minimum needed to get Names[]. When the actual functions are shown,

Print[FromCharacterCode[List[72,101,108,108,111,44,32,87,111,114,108,100,33]]]

Where all the functions are hidden inside a Names[][[1234]] so that they can all be numerically decided, but Names[], at minimum, needs \13456 to derive everything else, the 0 is needed to turn Names's string output into Functions, as 0[[0,0]] returns Symbol.

I know that after making this whole thing it can be golfed to do without 0, as the only time it comes up is in addition, inside the octal for the + symbol, and getting the symbol header, meaning that if 0 can be derived elsewhere then in the charset 0 can be switched to +, lowering the score by 5. All it would need is to not use commas inside list. The only function that I recall that can do this is the Append family, but calling Append instead of each comma makes the program over 2k in size.

In case you want to see how it was generated, I will put most of my code here

Aiden Chow · Accepted Answer · 2022-08-08 07:30:41Z

4

Knight, 460 383 442 bytes, score 268 236 226

-32 score thanks to @Adam by utilizing A1

-10 score thanks to @emanresu A and @UnrelatedString by using E to EVAL O"Hello, World" instead of using O directly

E+++++++++++++++A+11+11+11+11+11+11+11+1+1A1A+11+11+11+1A1A+11+11+11+11+11+11+1+1+1+1+1+1A1A+11+11+11+11+11+11+11+11+11+1+1A1A+11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1A1A+11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1A1A+111A1A+11+11+11+11A1A+11+11+1+1+1+1+1+1+1+1+1+1A1A+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1+1A1A+111A1A+111+1+1+1A1A+11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1A1A+11+11+11+11+11+11+11+11+11+1A1A+11+11+11A1A+11+11+11+1A1

Characters used: E+A1

Try It Online!

(Code used to generate this Knight code: Try It Online!)

edited Aug 8, 2022 at 7:30

answered Aug 7, 2022 at 9:57

Aiden Chow

14.2k1 gold badge17 silver badges55 bronze badges

\$\begingroup\$ You can actually do this without spaces, e.g. controlc.com/d04bd5eb. You can probably modify your code to get rid of spaces as well. \$\endgroup\$
– 97.100.97.109
Commented Aug 7, 2022 at 23:02
\$\begingroup\$ Here's the equivalent for your code: controlc.com/8ce83f01 \$\endgroup\$
– 97.100.97.109
Commented Aug 7, 2022 at 23:09
\$\begingroup\$ @Adam Wow doing A1 is actually super smart, editing my answer now. \$\endgroup\$
– Aiden Chow
Commented Aug 8, 2022 at 6:23
1

\$\begingroup\$ If you have the willpower, E has a lower charcode than O. \$\endgroup\$
– emanresu A
Commented Aug 8, 2022 at 6:44
1

\$\begingroup\$ @UnrelatedString Bro that's actually big brain, wowow \$\endgroup\$
– Aiden Chow
Commented Aug 8, 2022 at 7:25

| Show 1 more comment

79037662 · Accepted Answer · 2020-03-24 05:27:44Z

brainfuck, 134 score

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.+++++++++++++++++++++++++++++.+++++++..+++.+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.+++++++++++++++++++++++++++++++++++++++++++++++++++++++.++++++++++++++++++++++++.+++.------.--------.-------------------------------------------------------------------.

Try it online!

Alas, could have scored 89 if not for the 1000 character limit.

Boolfuck, 102 score

;;;+;+;;+;+;+;+;+;+;;+;;+;;;+;;+;+;;+;;;+;;+;+;;+;+;;;;+;+;;+;;;+;;+;+;+;;;;;;;+;+;;+;;;+;+;+;+;+;+;;;;+;+;;+;;+;+;;+;;;+;;;+;;+;+;;+;;;+;+;;+;;+;+;+;;;;+;

Try it online!

"Standard".

I was going to make a brainf*** solution (generated with Python) and it was exactly your solution, so I upvoted it. Nice going! :) — KinuTheDragon, Commented Jun 7, 2021 at 21:25

Mitchell Spector · Accepted Answer · 2020-03-25 03:52:34Z

3

dc, ^{106 652 192} 428 bytes, score ^{332 272 272} 204

11 11+11+11+11+11+1+1+1+1+1+1+P11 11+11+11+11+11+11+11+11+1+1+P11 11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1+P11 11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1+P11 11+11+11+11+11+11+11+11+11+1+P11 11+11+11+P11 11+1+1+1+1+1+1+1+1+1+1+P11 11+11+11+11+11+11+1+1+1+1+1+1+1+1+1+1+P11 11+11+11+11+11+11+11+11+11+1+P11 11+11+11+11+11+11+11+11+11+1+1+1+1+P11 11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1+P11 11+11+11+11+11+11+11+11+1+P11 11+11+P

Try it online!

4 characters used: +1P and the space character.

edited Mar 25, 2020 at 3:52

answered Mar 24, 2020 at 5:24

Mitchell Spector

7,9631 gold badge17 silver badges35 bronze badges

\$\begingroup\$ You need to sum the codepoints of all characters you use in your program. \$\endgroup\$
– user92069
Commented Mar 24, 2020 at 5:25
\$\begingroup\$ @a'_' You're right - I misread the scoring in the challenge. It's fixed. \$\endgroup\$
– Mitchell Spector
Commented Mar 24, 2020 at 5:29
\$\begingroup\$ You may be interested in the bounty to codegolf.stackexchange.com/q/11336 for the dc solution with the lowest number of unique characters \$\endgroup\$
– user41805
Commented Feb 6, 2021 at 11:59
\$\begingroup\$ @user41805 Thanks, I hadn’t seen the bounty. (I haven’t had time to do any code golf for a while.) \$\endgroup\$
– Mitchell Spector
Commented Feb 7, 2021 at 2:17

Add a comment |

Noodle9 · Accepted Answer · 2020-09-21 15:50:15Z

3

C (gcc), ^{344 \$\cdots\$ 254} 242 bytes, score ¹⁶²⁴ 1575

Lowered score by 49 thanks to Arnauld!!!

Saved 12 bytes thanks to ceilingcat!!!

h;t;u;i;a;main(c){u+=u=i+=i=a=c+c+c;t=u+u+u;putchar(putchar(t+t)+u+u+a+c+c);putchar(putchar(putchar(h=t+t+t))+a);putchar(t+i+c+c);putchar(u+u+i+c+c);putchar(t+t+u+a);putchar(h+a);putchar(h+i);putchar(h);putchar(t+t+u+u+a+c);putchar(u+u+i+a);}

Try it online!

Uses characters: ()+;=achimnprtu{}

edited Sep 21, 2020 at 15:50

answered Mar 24, 2020 at 13:30

Noodle9

20.3k3 gold badges21 silver badges46 bronze badges

\$\begingroup\$ You can get rid of 1 by retrieving it from argc, leading to 1575 points. \$\endgroup\$
– Arnauld
Commented Mar 24, 2020 at 17:17
\$\begingroup\$ @Arnauld Very clever - thanks! :-) \$\endgroup\$
– Noodle9
Commented Mar 24, 2020 at 17:24
\$\begingroup\$ @Arnauld Why not? Thanks! :-) \$\endgroup\$
– Noodle9
Commented Mar 24, 2020 at 17:37
\$\begingroup\$ @Arnauld Knocked down to a quarter K - thanks! :-) \$\endgroup\$
– Noodle9
Commented Mar 24, 2020 at 17:50
\$\begingroup\$ Yeah, that's a nice round figure. And that's why I didn't submit the 254-byte version. ;) \$\endgroup\$
– Arnauld
Commented Mar 24, 2020 at 17:55

| Show 4 more comments

emirps · Accepted Answer · 2022-11-07 20:29:01Z

Grass, score 324, 623 bytes

wvwwWWwWWWwvWwwwwWWwWWWwWWWWwWWWWWwWWWWWWwWWWWWWWwWwwwwwwwwwwwwWWWWwWWWWWWWwWWWWWWWWWWWWWWwWWWWWWWWWWWwwWWWWWWWWWWwwWWWWWWWWWWWWwWWWWWWWWWWwwWWWWWWWWWWwwwwwwwWWWWWWWWWWWWWWwWWWWWWWWWWWWWWWWwWWWWWWWWWWWWWWWWWWWWWWwWWWWWWWWWWWWWWWWWWWwwWWWWWWWWWWWWWWWWWWwwWWWWWWWWWWWWWWWWWWwwwwwWWWWWWWWWWWWWWWWWWWWWwwWWWWWWWWWWWWWWWWWWWWWWWwWWWWWWWWWWWWWWWWWWWWWWWWWWwwwwwwwwwwwwwwwwwwwwwwwwwwwWwwwwwwwwwwwWWwwwwwwwWWWwwwwwwwWWWWwWWWWWwwwwwwwwWWWWWWwwwwwwwwwwwwwwwwwWWWWWWWwwwwwwwwwwwwwwwwwwwwwWWWWWWWWwwwwwwwwwwwwwwwwwWWWWWWWWWwwwwWWWWWWWWWWwwwwwwwwwwwWWWWWWWWWWWwwwwwwwWWWWWWWWWWWWwwwwwwwwwwwwwwwwwwWWWWWWWWWWWWWwwwwwwwwwwwwwwwwwwwwwwwwww

bigyihsuan · Accepted Answer · 2024-09-23 14:03:44Z

3

Go, 61 48 bytes, score 2527 2401

package main;func main(){print("Hello, World!")}

Attempt This Online!

The boilerplate hello world, compressed onto 1 line.

-13 bytes and -126 score from printing to STDERR instead.

edited Sep 23 at 14:03

answered Nov 4, 2022 at 17:06

bigyihsuan

10.8k1 gold badge23 silver badges66 bronze badges

\$\begingroup\$ 48 bytes \$\endgroup\$
– 鳴神裁四点一号
Commented Sep 23 at 5:56

Add a comment |

Bubbler · Accepted Answer · 2020-03-24 05:52:46Z

Brain-Flak, 618 bytes, score 265

((((((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()())()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()())()()()()()()()())()()()()()())[()()()])[()()()()()()()()()()()()()()()()()()()()()()()()])(((((((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()())()()()()()()()()()()()())()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()())[()()()]))[()()()()()()()])[()()()()()()()()()()()()()()()()()()()()()()()()()()()()()])

Try it online!

Used characters: ()[]

Uses () (one), (...) (sum and push), [...] (negate). Can definitely be shorter by using [] (stack height) but it's not the point of the challenge (as long as the code is under 1000 bytes). Looks like the program can't fit into 1000 bytes using only () and (...).

Bubbler · Accepted Answer · 2020-03-24 06:11:47Z

Python 2, 574 bytes, score 564

exec"%c"%(111+1)+"%c"%(111+1+1+1)+"%c"%(11+11+11+11+11+11+11+11+11+1+1+1+1+1+1)+"%c"%(11+11+11+11+11+11+11+11+11+11)+"%c"%(111+1+1+1+1+1)+"%c"%(11+11+11+1+1+1+1+1+1)+"%c"%(11+11+11+11+11+11+1+1+1+1+1+1)+"e%c"%(11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1)+"%c"%(11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1)+"%c"%111+"%c"%(11+11+11+11)+"%c"%(11+11+1+1+1+1+1+1+1+1+1+1)+"%c"%(11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1+1)+"%c"%111+"%c"%(111+1+1+1)+"%c"%(11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1)+"%c"%(11+11+11+11+11+11+11+11+11+1)+"%c"%(11+11+11)+"%c"%(11+11+11+1+1+1+1+1+1)

Try it online!

Used characters: exc"%(1+)

Constructs the string print'Hello, World!' using the characters "%c(1+), then execs it. Using the raw print with any single extra character costs more than this.

Community · Accepted Answer · 2020-06-17 09:04:33Z

05AB1E, score: 282 (251 bytes)

0>>>0>>>>>>>>>0>0>>>0>>>>>>>>0>>>>>0>>>0 0>>>>>>0>>>>>>>>0>>>>>>>>0>>>>0>>>>>>>0>>0 0>>>>>>>0>>>0 0>>>>>0>>>>>>>>>0>>0>>>0>0>>>>>>0 0>>>>>>>J 0>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>B

Try it online.

Five characters used: 0> JB

Explanation:

First we construct the number 39138530688472073059231607. We do this per digit, by pushing a 0 and increasing it by 1 per >, after which the entire stack of digits is joined together with J.
Then it pushes another 0 with 107 >s to get the number 107.
After which it will convert 39138530688472073059231607 to base-107 with B, which is "Hello, World!".

The Fifth Marshal · Accepted Answer · 2020-03-25 21:41:23Z

2

Help, WarDoq!, 1 byte, Score: 72

Try It Online!

edited Mar 25, 2020 at 21:41

The Fifth Marshal

6,2531 gold badge25 silver badges44 bronze badges

answered Mar 25, 2020 at 11:49

sportzpikachu

1815 bronze badges

Add a comment |

xikuuky · Accepted Answer · 2020-04-01 14:17:10Z

2

Rust, 35 bytes, Score: 1916

fn main(){print!("Hello, World!")}

I don't know if you can get any shorter in Rust.

answered Apr 1, 2020 at 14:17

xikuuky

313 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

2

H🌍, 2 bytes, score 223

hw

Try it online!

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 18, 2020 at 19:09

Luvexina

2533 silver badges12 bronze badges

Add a comment |

The Thonnu · Accepted Answer · 2022-11-04 17:02:07Z

Bits, score: 97

There are only 2 distinct characters in Bits, 0 and 1. These have ASCII values of \$48\$ and \$49\$, so the score is \$97\$.

If you're interested, this is actually only 10 bytes (80 bits).

10010000001010011000011000011110111000111111010111001111010010001100000100011101

Explanation

1001000 // H
000101  // e
001100  // l
001100  // l
001111  // o
011100  // ,
011111  //  
1010111 // W
001111  // o
010010  // r
001100  // l
000100  // d
011101  // !
        // [implicitly joined and output]

Bubbler · Accepted Answer · 2020-03-24 07:03:45Z

Gol><>, 234 bytes, score 259

llllllll+++l+++++lllllllllllll+++++l++++++++llllllllllll+++++l+l+++++++llllllllllll+++l+++++++++lllllllllll+++l++++++++lllllll++ll++l+++++llll+++l+l+lll++l+$llllllll++++++l++l+llllll+++lll+++++llllllll+++++++lll++l+l+l+llllll++++l++$H

Try it online!

Used characters: l (length of stack), + (add top two numbers), $ (swap top two numbers), H.

$ was needed because some characters (space, H) were impossible to create at that specific stack height; it is cheaper than any number literal (minimum being 0).

Gol><>, 182 bytes, score 315

ssP0ssssssPPPP0ssssssPPPPPPPPPPPP0sssssssPP0ssssssPPPPPPPPPPPPPPP0sssssPPPPPPP0ss0ssPPPPPPPPPPPP0ssssssPPPPPPPPPPPPPPP0ssssssPPPPPPPPPPPP0ssssssPPPPPPPPPPPP0ssssssPPPPP0ssssPPPPPPPPH

Try it online!

Used characters: 0 (push zero to the stack), s (add 16 to top), P (increment top), H (halt and print everything on the stack as characters).

Mitchell Spector · Accepted Answer · 2020-03-25 06:54:04Z

C (gcc), 540 bytes, score 1563

main(){putchar(11+11+11+11+11+11+1+1+1+1+1+1);putchar(11+11+11+11+11+11+11+11+11+1+1);putchar(11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1);putchar(11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1);putchar(11+11+11+11+11+11+11+11+11+11+1);putchar(11+11+11+11);putchar(11+11+1+1+1+1+1+1+1+1+1+1);putchar(11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1+1);putchar(11+11+11+11+11+11+11+11+11+11+1);putchar(11+11+11+11+11+11+11+11+11+11+1+1+1+1);putchar(11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1);putchar(11+11+11+11+11+11+11+11+11+1);putchar(11+11+11);}

Try it online!

This is just a straightforward solution that prints the ASCII code of each character in turn, like some of the other solutions here. I'm not aware of any tricky way to reduce the score in C.

\$\begingroup\$ 287 bytes, score 1563 \$\endgroup\$
– ceilingcat
Commented Sep 19, 2020 at 4:49 — ceilingcat, Commented Sep 19, 2020 at 4:49

S.S. Anne · Accepted Answer · 2020-04-07 18:40:31Z

1

Bash, 18 bytes, score 1005

echo Hello, World!

Try it online!

answered Apr 7, 2020 at 18:40

S.S. Anne

3,30810 silver badges31 bronze badges

Add a comment |

cobrexus · Accepted Answer · 2020-05-27 14:35:05Z

1

PHP, 13 bytes, score 802

Hello, World!

Try it online!

answered May 27, 2020 at 14:35

cobrexus

8336 silver badges19 bronze badges

Add a comment |

sporeball · Accepted Answer · 2020-09-10 02:05:44Z

naz, 732 bytes, score 372

1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1o1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1o1a1a1a1a1a1a1a1o1o1a1a1a1o1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1o1s1s1s1s1s1s1s1s1s1s1s1s1o1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1o1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1a1o1a1a1a1o1s1s1s1s1s1s1o1s1s1s1s1s1s1s1s1o1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1s1o

Uses 1, a, s and o.

Without the size restriction, naz -u could achieve a theoretical score of 257 by foregoing s.

ali bali · Accepted Answer · 2020-12-12 01:06:20Z

1

2/9 of an esolang, 1 byte, score = 64

answered Dec 12, 2020 at 1:06

ali bali

372 bronze badges

2

\$\begingroup\$ But the article says "Every line of code must be exactly 21 characters" \$\endgroup\$
– user100411
Commented Mar 30, 2021 at 13:46

Add a comment |

ali bali · Accepted Answer · 2020-12-12 01:07:22Z

1

G*, 15 bytes, score = 914

p Hello, World!

edited Dec 12, 2020 at 1:07

answered Dec 12, 2020 at 0:56

ali bali

372 bronze badges

Add a comment |

Xcali · Accepted Answer · 2020-12-13 05:20:09Z

1

Perl 5, 386 bytes, score = 818

say chr 11+11+11+11+11+11+1+1+1+1+1+1,chr 11+11+11+11+11+11+11+11+11+1+1,chr 11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1,chr 11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1,chr 111,chr 11+11+11+11,chr 1+1+1+1+1+1+1+1+1+1+11+11,chr 11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1+1,chr 111,chr 111+1+1+1,chr 11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1,chr 11+11+11+11+11+11+11+11+11+1,chr 11+11+11

Try it online!

answered Dec 13, 2020 at 5:20

Xcali

16.2k2 gold badges15 silver badges39 bronze badges

Add a comment |

xigoi · Accepted Answer · 2021-02-26 19:37:41Z

1

Nim, 387 bytes, score 601

ecHO cHR 11+11+11+11+11+11+1+1+1+1+1+1,cHR 11+11+11+11+11+11+11+11+11+1+1,cHR 11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1,cHR 11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1,cHR 111,cHR 11+11+11+11,cHR 11+11+1+1+1+1+1+1+1+1+1+1,cHR 11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1+1,cHR 111,cHR 111+1+1+1,cHR 11+11+11+11+11+11+11+11+11+1+1+1+1+1+1+1+1+1,cHR 11+11+11+11+11+11+11+11+11+1,cHR 11+11+11

Try it online!

Chars: ecHRO, +1

answered Feb 26, 2021 at 19:37

xigoi

7,3312 gold badges13 silver badges23 bronze badges

Add a comment |

hakr14 · Accepted Answer · 2021-02-27 00:39:41Z

1

Pyth, 430 bytes, score 191

++++++++++++C+++++++++++11 11 11 11 11 11 1 1 1 1 1 1C++++++++++11 11 11 11 11 11 11 11 11 1 1C+++++++++++++++++11 11 11 11 11 11 11 11 11 1 1 1 1 1 1 1 1 1C+++++++++++++++++11 11 11 11 11 11 11 11 11 1 1 1 1 1 1 1 1 1C111C+++11 11 11 11C+++++++++++11 11 1 1 1 1 1 1 1 1 1 1C++++++++111 1 1 1 1 1 1 1 1C111C+++111 1 1 1C+++++++++++++++++11 11 11 11 11 11 11 11 11 1 1 1 1 1 1 1 1 1C+++++++++11 11 11 11 11 11 11 11 11 1C++11 11 11

Try it online!

answered Feb 27, 2021 at 0:39

hakr14

5,0141 gold badge11 silver badges18 bronze badges

Add a comment |

2 revs, 2 users 95% · Accepted Answer · 2021-11-14 15:58:45Z

1

Deadfish~, 1 byte, score 119

Try it online!

Not so interesting

edited Nov 14, 2021 at 15:58

community wiki

2 revs, 2 users 95%
wasif

2

\$\begingroup\$ As this is code challenge and has special scoring, please also specify “score 119”. \$\endgroup\$
– manatwork
Commented Mar 31, 2021 at 1:57

Add a comment |

Hello ASCII World!

Rules

Example

44 Answers 44

C (gcc) -zexecstack -Wl,-e$ -nostartfiles on Linux x86-64, 876 914 bytes, score 798 293

C (gcc) -zexecstack on Linux x86-64, 891 bytes, score 1154

CJam, 652 bytes, score 120

Stuck, 0 bytes, score 0

HQ9+, 1 byte, score 72

Malbolge, 71 bytes, 3963 points

Wolfram Language (Mathematica), 321 bytes, score 399

Knight, 460 383 442 bytes, score 268 236 226

brainfuck, 134 score

Boolfuck, 102 score

dc, 106 652 192 428 bytes, score 332 272 272 204

C (gcc), 344 \$\cdots\$ 254 242 bytes, score 1624 1575

Grass, score 324, 623 bytes

Go, 61 48 bytes, score 2527 2401

Brain-Flak, 618 bytes, score 265

Python 2, 574 bytes, score 564

05AB1E, score: 282 (251 bytes)

Help, WarDoq!, 1 byte, Score: 72

Rust, 35 bytes, Score: 1916

H🌍, 2 bytes, score 223

Bits, score: 97

Explanation

Gol><>, 234 bytes, score 259

Gol><>, 182 bytes, score 315

C (gcc), 540 bytes, score 1563

Bash, 18 bytes, score 1005

PHP, 13 bytes, score 802

naz, 732 bytes, score 372

2/9 of an esolang, 1 byte, score = 64

G*, 15 bytes, score = 914

Perl 5, 386 bytes, score = 818

Nim, 387 bytes, score 601

Pyth, 430 bytes, score 191

Deadfish~, 1 byte, score 119

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-challengerestricted-sourcehello-world or ask your own question.

Linked

Related

Hot Network Questions

C (gcc) `-zexecstack` `-Wl,-e$` `-nostartfiles` on Linux x86-64, 876 914 bytes, score 798 293

C (gcc) `-zexecstack` on Linux x86-64, 891 bytes, score 1154

dc, ^{106 652 192} 428 bytes, score ^{332 272 272} 204

C (gcc), ^{344 \$\cdots\$ 254} 242 bytes, score ¹⁶²⁴ 1575

Not the answer you're looking for? Browse other questions tagged
code-challenge
restricted-source
hello-world
or ask your own question.