New answers tagged code-challenge
0
Runic Enchantments, Score: 1091
"Hell0 W0rld!"@
Try it online!
I honestly can't find a way to do this cheaper. The costs of string manipulation are just not worth the savings that can be gained. Eg. subtrating 30 from each character the output string saves 360 but costs 289 to undo plus another 165 in control logic (454 total). Encoding the operational ...
1
7, 41 characters, code point sum 81
32002453003001200522231203103002440537403
Try it online!
Unlike with many of my 7 programs, there's nothing particularly clever going on here; this basically just prints a string in the simplest possible way (which in 7 involves encoding the string into a piece of source code, evaluating it, analysing the resulting ...
1
Japt, Score: 863
")FMM8SME"c+#
Test it
1
str, Score: 1081
`(ELL7RLD`32+o;
There are a lot of unprintable characters that don't show up above, see the TIO link for the full code.
Adds 32 to each character to get a lower score (the naive solution has a score of 1321)
Try it online!
6
05AB1E, score 513
Posting this separately from my other answer, as this one is arguably less cheating. I've been waiting for somebody else to do this for a while, but nobody did. I tried multiple languages. Pyth has extremely short code for this (Cl"...", if I remember correctly), but it turned out it can't input null bytes, and most other golfing languages ...
1
Bash, score: 1406
echo Hell0 W0rld!
Try it online!
0
ink, Score: 959
Hell0 W0rld!
Try it online!
1
Turing Machine Code, Score: 7105
0 _ H r 1
1 _ e r 2
2 _ l r 3
3 _ l r 4
4 _ 0 r 5
5 _ _ r 6
6 _ W r 7
7 _ 0 r 8
8 _ r r 9
9 _ l r a
a _ d r !
! _ ! r halt
Try it online!
Turing Machine But Way Worse, Score: 69695
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 0 0
0 5 0 1 6 0 0
0 6 0 1 7 0 0
0 7 0 1 8 1 0
0 8 0 1 9 0 0
0 9 1 1 10 0 0
0 ...
2
brainfuck, score: 5822
++++++++++[>+++++++>++++++++++>+++++++++++>+++++>+++>+++++++++<<<<<<-]>++.>+.>--..>--.>++.>---.<<.<++++++.------.<-.>>>+.
Try it online!
5
Keg, sum = 966 868 853
�GOU�� +��OOH� +(�+,
Try it online!
-15 bytes from cutting out the 0 (with a bit of help from the awful old Python script).
Based on a comment by Night2, as well as Jo King's old 32-byte quine.
Old explanation:
�DLR�� +0�LLE� + Push every codepoint of "Hell0 W0rld!", minus 32.
� + (This includes pushing ...
1
MSM, Score: 1465
!dlr0W 0lleH...........
It is great that ! is not an MSM instruction. Half of the program pushes onto stack, half of it concatenates them.
6
COW, Score: 117799
MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO
MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO
MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO
MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO
MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO Moo MoO MoO
MoO MoO MoO MoO MoO MoO MoO MoO MoO MoO ...
0
Scratch 3, score: 2908 2012
In ScratchBlocks Syntax.
define
say[Hell0 W0rld!
Defines an anonymous function. When called, it returns Hell0 W0rld!.
http://scratchblocks.github.io/#?style=scratch3&script=define%0Asay%5BHell0%20W0rld!%5D
1
Labyrinth, Score:2151
72.101.108.108.48.32.87.48.114.108.100.33.@
Explanation
72 Push ord code of 'H'
. Output
101.108.108.48.32.87.48.114.108.100.33. And so on
@ And exit.
Try it online!
1
evil, Score: 12853
Hard-code the characters
zaeeeaeeewzaeeaeeaeawzuueeueueawzuueeueueawzaeeeaeewzaeeeeewzaeeeeeuewzaeeeaeewzuueeueeaaawzuueeueueawzaeeaeeaewzaeeeeeaw
Try it online!
5
MineFriff, Score: 3725
Cff3,a*a,9*c,a*b4,6*8,8*a7,ff2,8*6,9*c,:a*a1,9*8,`
>l?#;o~
Try it online!
This ain't winning any competitions any time soon I tell you (I dread seeing what Scratch's score would be...). I'll post an image of what this looks like in-game soon, but first I have to actually re-install the python-in-minecraft mod and actually get it ...
1
J, Score: 1452
echo'Hell0 W0rld!'
Try it online!
3
bit**, Score: 2519
#72/#101/#108/#108/#48/#32/#87/#48/#114/#108/#100/#33/
Try it online!
10
Lenguage, score 0
Well, this is quite boring and obvious, but it seems to achieve the perfect score (assuming I understand the challenge correctly). To fix this loophole, you should probably add the program's length to the sum of the code points; I'm pretty sure that won't break the relative order of the current answers.
The program is
...
2
Forth (gforth), Score: 1105
." Hell0 W0rld!"
Try it online!
Prints the given string to stdout.
1
shortC, Score:1166
ShortC version of this.
AJ"Hell0 W0rld!"
Try it online!
1
Ruby, Score:1139
p"Hell0 W0rld!"
Try it online!
1
Python 2, Score:1584
Prints the string...
print"Hell0 W0rld!"
Try it online!
1
Zsh, Score 1207
<<<"Hell0 W0rld!"
Try it online, with a self-scorer!
Using <<<Hell0\ W0rld! is shorter, but more expensive: \ = 92, but 2⨯" = 68.
4
HTML, Score: 959
Hell0
W0rld!
If newlines (\r and \n) would have been count as their ASCII code (10 and 13) the score would be 937 or 940 because in HTML, new lines in "inline" elements are rendered as space.
3
05AB1E, Score:993
Just the string
"Hell0 W0rld!
Try it online!
Polyglot with Actually and Stax and Foo and Pyth
3
Jelly, Score:1213
Just the string. Nothing interesting.
“Hell0 W0rld!
Score: 1744
Simply a compression.
“ØƲṡhḍḊF®Ḍ?»
Try it online!
Code page summator
1
C (gcc), Score: 2021
Thanks to GammaFunction
A(){puts("Hell0 W0rld!");}
Also, just for fun, here is a C program that has a score of 1 using overflow.
It's a base64 encoded rar file
https://pastebin.com/SJMcRnLj
Try it online!
2
MathGolf, Score: 1027
"Hell0 W0rld!"
2218 is not short at all.
'H╖○ƒ0 'W0╖yü'!
Try it online!
Polyglot with CJam and GolfScript
3
PHP, Score: 959
"Classic" answer. PHP outputs by default.
Hell0 W0rld!
Try it online!
Polyglot with Carrot and Canvas and Charcoal
3
Keg, Score: 1051
Hell0 W0rld\!
Try it online!
2
Wolfram Language (Mathematica), score 31 + 2 = 33
&
)
#
@
/
]
&
2
#
>
-
"
"
.
/
#
[
d
l
o
F
(
@
e
...
0
F is for Forth (gforth), 26 + 5 = 31
'{ 'a [do] [i] emit [loop]
Try it online!
Two improvements over the submission by leancz 6 years ago:
An ASCII char prefixed with a quote gives the ASCII value of that char. So '{ saves a byte over 123. 'a is just for consistency.
The looping words including do and loop can't be used in interpreted mode, but gforth ...
2
Charcoal, score 22 18
κ→
Ｐ
!
Ｋ
Ｋ
‹
¿
ι
Ｆ
←
«Ｊ⁰¬¹
Ｓ
Ｗ
Note: This is designed for a pleasant input format i.e. at least one character on each line, then a completely empty line to terminate the input. Replace Ｗ with Ｆ and Ｓ with Ａ for a JSON-like input ...
4
Jelly, score 9 + 0 = 9
Z
⁶
€
ɗ
o
Ḣ
ḟ
Ṛ
Ỵ
From the top:
ỴZḟḢoɗ€⁶
Try it online! (or see it self-operate)
From the side:
ỴṚḟḢoɗ€⁶Z
Try it online! (or see it self-operate)
How?
Ỵ Z|Ṛ ḟḢoɗ€⁶ [Z] - Link list of characters:
Ỵ - split at newline characters
Z - | top: transpose to get columns
...
3
Pyth, 15 score
z
.T.
;
d
+
!
\
D
<
h
m
s
_
The two programs are:
smh<D\!d.T.z
Try it online!
_smh<D\!+d;.z
Try it online!
I attempted to make the code as similar as possible between the two programs, hence a few inefficiencies in each. Both programs filter out unwanted spaces by ...
9
An extension to @Grimy's code gets N=8
This just underlines that @Grimy deserves the bounty:
I could prune the search tree by extending the code to check, after each finished polyomino, that the remaining free space is not partitioned into components of size not divisible by N.
On a machine where the original code took 2m11s for N=7, this takes 1m4s, and ...
14
C, 7 terms
The seventh term is 19846102. (The first six are 1, 1, 2, 22, 515, 56734, as stated in the question).
#include <stdio.h>
#include <string.h>
#include <stdint.h>
#define N 7
#define ctz __builtin_ctzl
typedef uint64_t u64;
static u64 board[N*N] = { 0 };
static u64 adjacency_matrix[N*N] = { 0 };
static u64 count = 0;
static ...
1
X is for x86, 9 bytes + 3 -> score 12
(or "x86 machine code" for 9 + 16 = 25)
b0 61 aa 40 3c 7a 76 fa c3
This is a function, callable with void alpha(char edi[26]), like the x86-64 System V calling convention but in 32-bit mode. Or 16-bit mode (where 40 decodes as inc ax, otherwise the same).
The question says "program" that "prints", and this is ...
1
F is for Fish, 16 bytes; score 20
"a"r:o1+:"{"=?;r
2
53,268 29,596 29,306 total precision
Private communication with @A.Rex led to this solution, in which we construct a neural net that memorizes the answers. The core idea is that every function \$f\colon S\to\mathbf{R}\$ over a finite set \$S\$ enjoys the decomposition
$$ f(x) = \sum_{s\in S}f(s)\cdot \left\{\begin{array}{cl}1&\text{if }x=s\\0&\...
0
Go, $84426
func f(){print("$",'')}
The character in the single quotes is the Unicode character with code point U+149CA, encoded as 4 bytes in UTF-8. The Unicode standard does not currently assign it a value, but it is nevertheless valid to place it in Go source code, earning me only 18 cents below the maximum for 27 bytes. If you prefer, the character U+...
1
Zsh, $127569, 15 bytes
];<<<\$$?${-%?}
Try it online!
Squeezing out a bit more than the Bash answer by abusing the default flags. By default, the $- parameter is set to 569X. ${ %?} removes the last character. We can actually get a lot further by manually controlling the flags:
zsh -178, $156789, 11 bytes
<<<\$${-%?}
Try it online!
...
0
Cascade, $177827, 10 bytes
^𫚣$
#"
Try it online!
I'm lucky here in that 𫚣 counts as a letter variable, which allows me to fetch its ordinal value, with the cost that it is a multi-byte character.
5
14,674,000,667 5,436,050 5,403,448 10,385 5,994 4,447 3,806 total precision
For a baseline, I investigated the following approach: Select \$M,\delta,\epsilon>0\$ such that if we sample the polynomial \$p(x)=x^3+ax^2+bx+c\$ at
$$ S:=\{-M,-M+\delta,-M+2\delta,\ldots,M\}, $$
then the largest sample point \$s^\star\in S\$ satisfying \$p(s^\star)<\...
1
182 white squares
Inspired by Robin Ryder's answer, I tried to squeeze in a couple more white squares. I believe this solution is unique, and I will soon post verification code accordingly.
Computer-readable grid:
HETERONORMATIVE
OVEROPINIONATED
POSSESSEDNESSES
B##############
INCOMMUNICATIVE
NEUROANATOMICAL
DETERMINATENESS
###############
...
12
Octave, 96 88 87 84 76 54 50 weights & biases
This 6-layer neural net is essentially a 3-step sorting network built from a very simple min/max network as a component. It is basically the example network from wikipedia as shown below, with a small modification: The first two comparisons are done in parallel. To bypass negative numbers though the ReLU, ...
9
180 white squares
My strategy was simply to find a smaller rectangle with no black squares, such that it can be filled in uniquely. All 2×k rectangles have multiple solutions. For 3×k rectangles, there are multiple solutions for k between 3 and 14, but there is a exactly one solution for k=15.
I then fit 4 such rectangles in the grid. This means that ...
0
[Python 3] (644449*2+0) 1288898 points
Perfect accuracy in only 644449 bytes
import zlib,base64 as s
t=enumerate(zlib.decompress(s.b64decode(b'###')).decode());a=lambda c:next(t)[1]
The full code cannot fit in an answer, so I have put it here and replaced the large binary string literal with b'###' in the answer text.
This is generated with the ...
1
I is for Io, 31 characters -> Score: 33
for($,65,90,$asCharacter print)
Top 50 recent answers are included
