44

Score 1, 35 generations Sorry, but I guess I wrecked the challenge. I brute-forced all meaningful one-dot additions by hand, and found no other answer that wins against this. Raw ASCII format OOO OOO OOO OOO O O O O O O O O O O OO O O O O O O O OOO OO OOO OOO X Image of initial state Copy.sh export #C ...


32

Node.js,  135 126 125  123 bytes, score 40 Saved 2 bytes by using unprintable characters, as suggested by @dingledooper s=>Buffer('~>/6%sH~~d4~\\~i~~,~~~~~.~~~~n)W*~~~~;~CR@M"~1E~$~ _Z9~')[parseInt(s[0]+s[4]+s[19],34)*57%65]*209%523 Try it online! Decoding example Let's consider the input string "Internal Server Error". We extract the ...


31

Python 3, infinity points exec('exec("N=2%F=@@@%Q=chr' '(39)*3%def?magic(s,N,W,H=N' 'one):%?if?H?is?None:%??H?=' '?W//2%?L=[%?@###,#,###,###' ',#?#,###,###,###,###,###@.' 'split(@,@),%?@#?#,#,??#,??' ...


26

JavaScript (Node.js), 10 programs, 299 bytes (A=_=>setTimeout(A,B=_=>0))(); (B=_=>setTimeout(B,C=_=>0))(); (C=_=>setTimeout(C,D=_=>0))(); (D=_=>setTimeout(D,E=_=>0))(); (E=_=>setTimeout(E,F=_=>0))(); (F=_=>setTimeout(F,G=_=>0))(); (G=_=>setTimeout(G,H=_=>0))(); (H=_=>setTimeout(H,I=_=>0))(); (I=_=>setTimeout(...


26

Backhand, Score 0, 137 bytes ""###:::[[[:::::::::)))))))))888999***EEE666***333+++ssscccjjjlll222%%%]]]333***xxx(((sss~~~rrr~~~''' sss---***333aaa000~~~rrr:::rrrHHH Try it online! I've included the interpreter here because the version on TIO is a bit out of date (in this case missing the instructions Equal and skip). E could be compensated for ...


25

FFmpeg -crf 0 -preset ultrafast -tune film -vf format=yuv444p, score 198.7425 Input is a 65535 × 1 PBM file: P4 65535 1 ...


23

Whitespace, 390 bytes, A-Z Exploiting the rules a little: Whitespace can be reused Try it online! Try it online! Try it online! Try it online! Try it online! Try it online! Try it online! ...


21

PowerShell, A-N 109 bytes Previously: A-F, 41 bytes || A-G, 53 bytes || A-K, 85 bytes || A-M, 101 bytes eCho a 'b' "c" {d} writE E ‛F‛ (mAn)[7][3] “H“ ”I” ’J’ ‘K‘ „L„ ‚M‚ sv N;gv N|% N* Try it online!


21

JPEG (4:4:4 Chroma subsampling), ~1584.35 Asking Redwolf about what the input file type for a PNG is, we hear that it's Any file you can get an implementation of a PNG converting program to accept. I realized that this means we're essentially looking for a file which compresses really well in one format but really horribly in another. I initially looked ...


20

Zsh, 56 bytes, 10 programs until wc<<Q|grep 36 yes yes;yes yes yes yes ;yes yes yes Try it online! The first and most important program is: until wc<<Q|grep 36 Each yes is part of one of the other programs. y it online! (note: TIO kills the program very quickly because yes produces over 128 KB of output, but if you ran it elsewhere it ...


19

Deadfish, all 35 characters, 444 bytes Uses s, d, and c, which are allowed, plus i as an extra. 6 iisiiisiiiiic 7 iisiiisiiiiiic 8 iisiiisiiiiiiic 9 iiisdsdddddddc 0 iisiiisdc - iisiiisddddc = iiisdsdddc y iiisiisc u iiisiisddddc i iiisisiiiiic o iiisisiiiiiiiiiiic p iiisiisdddddddddc [ iiissiiiiiiiiiic ] iiisisdddddddc h iiisisiiiic j iiisisiiiiiic k ...


17

Python 3, 68 bytes, score: 40 A cheap builtin answer. lambda s:+http.HTTPStatus[re.sub('\W','_',s.upper())] import http,re Try it online! Python 2, 131 119 115 104 bytes, score: 40 A nicer method with the same score, using a magic formula. @Arnuald's answer had a really nice way of calculating the status code, which saves me a ton of bytes. lambda s:ord('...


17

Javascript, score 5 6: x=>21%15 7: x=>22%15 8: x=>23%15 9: x=>24%15 0: x=>1%1 12345QWERTASDFG<>ZXCqwertasdfgzxc!@#$% Step 1: Functions or programs. We need to have functions, so we have to take =, from which we can make x=>[code] or similar. So, what can we do with what we've got? 67890 can be made with numeric operations. But for ...


17

Python 3, 167 bytes, produces Python 3.0, 3.1, ..., 3.9, 3.10, \${167 \over 11^2}\approx1.38\$ thanks to SuperStormer for refreshing my memory, allowing to add 3.10. lambda r:'try:exec("%s");o=%d\nexcept:0\n'*10%sum(zip("0;int.bit_length;callable;u'';import enum;b''%();f'';breakpoint;(a:=0);{}|{}".split(';'),r),())+'print(o)' Try it ...


16

Backhand, Turtlèd, Gol><>, ><>, Pushy, Wumpus, Fission, Beeswax, Emoji, Emotinomicon, AsciiDots, Cardinal, Befunge-93, Functoid, Alice, Befunge-98, Klein, PingPong, Whispers v1 and v2, Thue, Perl, Raku, Rail, Self-modifying Brainfuck Score: 3.04 1.3 0.934 0.693 0.605 \${\frac{295}{25^2} = 0.472}\$ puts'#\ v/v"Z"rH"Z"y"#"Z"#>o<~"`Z"#! ...


15

Python by Sisyphus for Is this number a prime? \$ 110728750366081 = 37 \times 41 \times 71 \times 661 \times 673 \times 2311 \$ is wrongly recognized as a prime. Try it online! Sisyphus implemented the Solovay-Strassen primality test, which is based on a theorem by Euler which states for any prime number \$p\$ and any integer \$a\$: $$ a^{p-1\over2} \equiv \...


14

BSD Compress, 1.4746 Unlike gzip, compress doesn't check whether it would be cheaper to store an uncompressed block, so its worst case performance is much worse than gzip's. If you give it a file of completely random bytes, without any patterns or redundancies to take advantage of, compress fails miserably. python3 -c 'from numpy import random; random.seed(...


14

Labyrinth, score 35, 180 bytes 6 54.@ 7 55.@ 8 312.@ 9 313.@ 0 !@ - 45.@ = 1341.@ y 121.@ u 1141.@ i 2153.@ o 111.@ p 112.@ [ 1115.@ ] 2141.@ h 2152.@ j 2154.@ k 1131.@ l 1132.@ ; 315.@ ' 551.@ \ 4444.@ v 4214.@ b 354.@ n 1134.@ m 1133.@ ^ 2142.@ & 2342.@ * 42.@ ( 552.@ ) 41.@ _ 351.@ + 43.@ : 314.@ " 34.@ | 124.@ Try the comprehensive test online! ...


14

Befunge-93, 25 22 bytes (10 programs) 12+3+4+5+6+7+8+"#"`#@_ Try it online! Thanks JoKing for the suggestion (-3 bytes). Exaplanation The programs are: 1 Push 1 2 Push 2, pop two value and push the sum + Pop two value and push the sum 3+ Push 3, pop two value and push the sum 4+ Same with 4 5+ ... 6+ 7+ 8+ "#"`#@_ ...


13

\$n=2\$, 41 generations #C Generated by copy.sh/life x = 19, y = 8, rule = B3/S23 11bo$b3o2b3o2b3o2b3o$o4bo4bo4bo$o4bo4bo4bo$o4bob2obo4bo$o4bo2bobo4bo$b 3o2b2o3b3o2b3o$10bo! Run it online here. Here's what the initial position looks like:


13

2986 2320 1228 generations I wrote a rudimentary Python script for Golly to generate random 5x10 patterns until it encountered one whose population was fixed, and whose bounding box was not too large (as would be expected of soups containing spaceships, as spaceships expand the bounding box as they travel). Here was what it came up with after about 50,000 ...


12

Day 0. Java (OpenJDK 8), 5 bytes a->"" Try it online! The line for tomorrow is Baka mitai kodomo na no ne. thanks to caird for reminding me i don't need to submit a full program lol


12

JavaScript, 10 programs / 271 bytes Saved 12+ bytes per program thanks to @tsh This is similar to the method used by @darrylyeo in this answer. o={get g(){while(k);},set go(_){k--;}};k=9;o.g o={get g(){for(;;)0}};o.g o={get g(){for(;;)1}};o.g o={get g(){for(;;)2}};o.g o={get g(){for(;;)3}};o.g o={get g(){for(;;)4}};o.g o={get g(){for(;;)5}};o.g o={get g(){...


11

Jelly, Score 1 * 8 bytes = 8 String zip: +Ẇɼ+ Try it online! Cantor pairing function: +ẆL+ Try it online! We use the fact that the Cantor pairing is equal to $$ {n + m + 1 \choose 2} + m $$ Where the left term just happens to be the number of nonempty contiguous slices of \$m+n\$. This saves two bytes per program over the naive +‘×+H+, and one byte over ...


11

Python 2, 7 bytes, cracks xnor's post 0xbin() Try it online! The answer is easy to understand if syntax highlighting for above snippet works correctly. So bad. The syntax highlighting did work correctly. But SO changed their render library... Anyway, above code is: 0xb in ()


11

Score 8, 69 generations This is what I promised for in the comment, but it got already beaten by Dingus... I can't upload images right now, so I include a text-based initial configuration and the copy.sh export format. Raw ASCII format X X OOO OOO OOO OOO O O O O O O O O O O OO O O O O O O O OOO OO OOO ...


11

BSD Compress, 1.5721 The following Python script constructs a file which compresses worse than a random file. It continually extends the current file by a random byte, samples 20 different random choices and continues with the file which compresses the worst. Running the script took 1.5 hours on my machine, because it tries the compression on more than 200 ...


11

Sleep, all 35 chars, 5292 bytes 6 zzz zzz zzz zzz zzz zzz zzz zzz zzz zzz zzz zzz zzzzzzz z zzz zzz zzz zzz zzz zzz zzz zzz z zzz zzz zzz zzz zzz zzz zzz zzz zzz z zzz zzz zzz z zzz zzz zzz zzz zz zz zz zz zzzz zzzzzzzz z zzz zzzzz z zzzzz zz zzz zzz zzz zzz zzzzz z zzz zzz zzz zzz zzz zzz zzzzz zzz zzz zzzzz z zzz zzz zzz zzz zzzzz z zzz zzz zzz zzz zzz zzz ...


11

Day 0. Jelly, 1 byte ⁸ Try it online! The line for tomorrow is We're no strangers to love How it works ⁸ is a builtin for [] (the empty array), assuming no arguments are passed. Due to Jelly's printing, this displays nothing


11

JavaScript (V8), 10 programs, 188 bytes for(b=('a'in this);!b;); for(c=this.b;!c;); for(d=this.c;!d;); for(e=this.d;!e;); for(f=this.e;!f;); for(g=this.f;!g;); for(h=this.g;!h;); for(i=this.h;!i;); for(j=this.i;!j;); for(var a;!this.j;); Try it online! (all, halts) Try it online! (not all, does not halt) Javascript hoists the definition of a to the top of ...


Only top voted, non community-wiki answers of a minimum length are eligible