# Tag Info

### What did we forget?

zsh, 603 594 566 561 548 440 415 399 378 370 bytes ...
• 71.5k

Befunge-98, 884, n = 14, score ≈ 2.636 ...
• 197k

JavaScript, 228 bytes ...
• 4,146
Accepted

### A quantum quine

Backhand, Score 0, 137 bytes ...
• 47.2k

### Make a Geiger Counter

Lost, 303 293 263 253 238 228 bytes ...
• 47.2k

Pyth - 16 bytes The basic idea behind this is that when you take a digit off of 404, it only makes the number smaller, so we just have to get the maximum of two <...
• 25.7k

Befunge-98, 37 bytes 20020xx##;;11++::''ee44**kk@@::..;; Try it online! Explanation Making radiation-hardened code in Befunge-98 isn't too bad, because you ...
• 197k

### Make a Geiger Counter

Hexagony, 38 bytes .....;p;<>b;e;/<b;e;;p...@@.......;@.. Try it online! Verification program. Explanation We make use of Hexagony's auto-detection ...
• 17.3k

### Make a Geiger Counter

Klein XXX, 144 136 128 122 114 bytes This answer completes JoKing's challenge to make a Geiger counter that works in every Klein topology. ...
• 98.8k

Python 2, score:  56 50  48 bytes - 6 = 42 This is more an attempt to allow to remove more than 1 or 2 characters than to achieve the lowest possible score. Given the scoring scheme, allowing one more ...
• 193k

### What did we forget?

Retina, 1 byte 1 Try it online! When all instances of the single byte (1) are removed, the output is ...
• 40.1k

### Make a Geiger Counter

Hexagony, 34 29 bytes //..>;e;<b@;p;/|/;e;;\.b@;p<@ Try it online! Verification! Explanation: Here is the normal code formatted into a proper hexagon ...
• 47.2k

><>, 584 bytes, score 0 ...
• 47.2k
Accepted

05AB1E, 12 bytes Code: XX440044ÔÔŸŸ Normal code explanation: ...
• 44.4k

### Rearrangeable Code Bowling

Lenguage, 1,112,064 points if UTF-8 My program consists of every possible UTF-8 character. It prints out "Hello world", and uses 1.75 * 1076 yottabytes of space. (To generate the program, ...
• 14.5k

### Mutation-hardened quine

><>, 56 bytes ^ . + 8 f 0 o a o ~ : ? ~ : ? : - * 4 8 : ^ ^ } * 3 d ' Try it online! or verify all mutations. How the original program works (outdated) The ...
• 210k

brainfuck, 2 bytes, score 0 .. Try it online! Outputs two null bytes. Removing either . leaves ...
• 10.5k

### Write a near crystalline program

Ellipsis, score → 0 The program consists of $144 \times 8^n + 23$ ASCII periods . for $n \geq 0$, and gets a perfect score (i.e. every possible insertion causes ...

### Fault-Tolerant Hello World

Befunge-98, score 0, 45 bytes 20020xx""!!ddllrrooww ,,oolllleeHH""cckk,,@@ Try it online! Although an optimal solution has already been found (and there's no ...
• 197k

><>, 103 60 51 bytes vv ;?=*4o" e"n:ll<< ;?=*4o" e"n:ll<< Tested here. Uses the same tactic as this program....
• 23.4k

### Same code different characters

C, 231 Program A ...
• 72.1k

### Self Scoring Program

Backhand, 40 36 29 bytes vv""sseettyybb ""jjHHOO] Try it online! Verification! When in doubt, double up on everything. This uses Backhand's ...
• 47.2k

05AB1E, 9 7 bytes (Score of 3) 22'''rr Try it online! Removing a ' With any ' removed, <...
• 20.7k

### Make a Geiger Counter

Self-modifying Brainfuck, 73 63 bytes ...
• 47.2k

### Rearrangeable Code Bowling

Many languages, 2 points 0. Produces 0.0 as 0. or .0. ...