Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Kolmogorov complexity, informally, is the amount of code it takes to describe or produce a constant object, such as a string or image. When posting a challenge in this category, please make sure it adds something new to existing challenges.
5
votes
Accepted
Print the SARS-Cov-2 (COVID-19) genome
Sledgehammer, dev branch, 136 + 1 + 7196 = 7333 bytes
The dev branch is both more buggy and less buggy than the normal branch. At least # and variables work properly in it.
No built-in compression (ex …
23
votes
Print the SARS-Cov-2 (COVID-19) genome
bash + flif-tools, 40+1+7359 = 7400 bytes
First, I noticed that the probabilities of various letters weren't evenly distributed, and I thought I should use some kind of arithmetic coding. Then I reali …
2
votes
Logo Pack LAPACK
Retina, 62 bytes
This is way too long.
The markdown parser breaks terribly if I use the TIO's post snippet generator, so there's an extra leading newline in the snippet below: there is actually only 1 …
0
votes
Simple complexity
C# (.NET Core), 976 969 bytes
o=>{foreach(var l in new[]{35223185965568,52841249260288,0xf00c0c277f00,0x9004043ee900,0x977c7c200900,0xfee4e4300f00,0xc22727f00c00,73934616658944,0xc2000020097c,73667 …
5
votes
There are known knowns
C# (.NET Core), 54 bytes
v=>@"z zs
z unzs
unz zs
unz unzs".Replace("z","known")
Try it online!
1
vote
Confirm the Illuminati
C# (.NET Core), 144 bytes
This one may seem quite boring, because it is quite boring.
()=>@" ^
/_\
/z\
/z|_\
/_|/o\|_\
/z\_/z\
/z|z|z\
/z|z|z|_\
/z|z|z|z …
6
votes
First Number to Contain Each Letter
Wolfram Language (Mathematica), 50 bytes
Letters b, c, m, p and q are skipped for performance reasons when testing on TIO.
(i=0;While[1>StringCount[IntegerName@i,#],i++];i)&
Try it online!
2
votes
First Number to Contain Each Letter
Sledgehammer, 17 bytes
Technically, this is 133 bits long, but that doesn't really make this 16.625 bytes, as the compressor claims.
⣜⢍⢞⢹⡱⡋⣽⡱⡆⢺⢦⡽⡐⡌⢗⠈⣵
This probably decodes to
x1 = Input[]; x2 = …
3
votes
Rod of Asclepius
Bubblegum, 202 bytes
Uses the file with all unnecessary leading and trailing whitespace removed.
Since the code is a raw DEFLATE stream, here's a hex dump (not that it helps significantly):
00000000 …
3
votes
Rod of Asclepius
Jelly, 186 175 174 bytes
“ç⁺lñỊɓ¡ḌỌKḃßƇ[Æ÷ịœi#⁵Q#^Fo$Q$'ẠKẏȤ⁴ịɲɦʋỌ⁷ḄLqẏ⁺nÄẉ⁾ṀⱮsọḢɲlọȮḄṡ-$ɓv?KggjḞƭCid/ Ȥx?ßɓṇȯ¢ḋ®ṖIQṁ"œıṚ/£;ẉ*ȧ%¹ȯḷŻṖ4eS⁸w÷ƭʋịṢḤUKGɦðþḥ³-_?ߧlÇĠⱮkĠƝẎ3UỌYBTẋŒØL®œƇỊ⁼Ẓd’b37⁶”L2ƭx$€Fs69Y
…
7
votes
Print a tongue twister!
Bubblegum, 79 78 bytes
removed trailing newline for -1 byte
The text in the tongue twister has many simple patterns. There are enough of them that even "normal" languages can save bytes. However, the …
2
votes
Bloons TD 6 Upgrade Paths
Python 3, 75 bytes
print([r for r in[(x//36,x//6%6,x%6)for x in range(216)]if[0,3]>sorted(r)])
Try it online!
1
vote
Print X without X (robber's thread)
Befunge-98 (PyFunge), 37 bytes, cracks pppery's answer
This code is terrible.
"NRTS"4(0"<"1+D0"r"1+D0"o"1+D0"+"1+D@
Try it online!
6
votes
Print X without X (cop's thread)
Javascript, score: 83, cracked?
(the crack is not executable like /path/to/interpreter file.js, unlike my solution, but I don't think that matters a lot)
I only know one Javascript implementation wher …
2
votes
Print X without X (robber's thread)
Wolfram Language (Mathematica), 1422 bytes, cracks att's answer
this question is named incorrectly, we're actually the cops, trying to prevent all those evil newcomers from posting challenges we don't …