Skip to main content
105 votes
Accepted

Build a Markdown bomb

Blockquotes, 137,469/256 = 536.99 6,908 characters, 511 new lines, 130,050 spaces Markdown sure handles nested block-quotes oddly. Each > character gets turned ...
Namaskar's user avatar
  • 984
63 votes

Build a Markdown bomb

MathJax, 529\$\,\$252\$\,\$640ish / 256 ≈ 2\$\,\$067\$\,\$393 A good old thousand-laughs-style code ...
Roman Odaisky's user avatar
43 votes

Golf a number bigger than TREE(3)

New Ruby, 135 bytes, >> Hψ(φ3(Ω+1))(9) where H is the Hardy hierarchy, ψ is an extended version of Madore's OCF (will explain below) and φ is the Veblen function. Try it online! ...
Simply Beautiful Art's user avatar
28 votes

Golf a number bigger than TREE(3)

Haskell, 252 Bytes, TREE(3)+1 ...
Christopher King's user avatar
27 votes

Output two numbers (Cops' thread)

Zsh, 1 byte, score 124, provably uncrackable Programs output via exit code. / Outputs 126 ("permission denied"). Attempt This Online! [ Outputs 2 ("invalid argument"). Attempt This ...
pxeger's user avatar
  • 23.9k
26 votes

Build a Markdown bomb

Shorthand links: 68,960 / 256 = 269.375 ASCII only: 10,114 / 256 = 39.508 ...
bta's user avatar
  • 361
24 votes

Create the slowest growing function you can in under 100 bytes

Brachylog, 100 bytes llllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll Try it online! This is probably ...
Leo's user avatar
  • 12.7k
21 votes

Largest SKI output in less than 200 combinators

44 combinators, score: \$\approx f_{\omega+1}(3\uparrow\uparrow\uparrow\uparrow3)\$ ...
Bubbler's user avatar
  • 77k
18 votes
Accepted

Create the slowest growing function you can in under 100 bytes

Haskell, 100 bytes, score=fε0−1(n) _#[]=0 k#(0:a)=k#a+1 k#(a:b)=(k+1)#(([1..k]>>fst(span(>=a)b)++[a-1])++b) f n=[k|k<-[0..],1#[k]>n]!!0 How it works ...
Anders Kaseorg's user avatar
18 votes

Plight of the Concorde

88 Cities, 341 seconds runtime on NEOS In a recent paper we constructed a family of hard to solve euclidean TSP instances. You can download the instances from this family as well as code for ...
Stefan Hougardy's user avatar
17 votes

Golf a number bigger than TREE(3)

Python 2, 194 bytes, ~ Hψ(ΩΩΩ)(9) where H is the Hardy hierarchy, and ψ is the ordinal collapsing function below the Bachmann-Howard ordinal defined by Pohlers. Thanks to Jonathan Frech for -3 bytes....
Deedlit's user avatar
  • 381
15 votes
Accepted

Shortest terminating program whose output size exceeds Graham's number

Binary Lambda Calculus, 78 bits = 9.75 bytes Here is an expression in Binary Lambda Calculus that is less than 10 bytes, yet surpasses Graham's Number. This is over 5x shorter than my previous post in ...
Patcail's user avatar
  • 516
15 votes
Accepted

Golf a number bigger than TREE(3)

Javascript, 111 bytes, ~ \$f_{\psi(\Omega_\omega)}(6)\$ \$f\$ is the Fast-growing Hierarchy. \$ψ\$ is Buchholz's Psi. This entry, despite being 111 bytes, dominates all of the previous entries in both ...
Patcail's user avatar
  • 516
15 votes

Build a Markdown bomb

15888/50 = 317.76: Abuse of MathJaX This is the code: $$&$$$$&$$$$&$$$$&$$$$&$$$$&$$$$&$$$$&$$$$&$$$$&$$ This is what it ...
LambdaBeta's user avatar
  • 2,759
15 votes

Output two numbers (Robbers' thread)

Malbolge, 6 bytes, cracks Kamila Szewczyk's answer (&<`q# Try it online! (or try it here to avoid timing-out) Outputs 2. Explanation. The goal is to output ...
Dominic van Essen's user avatar
14 votes

Build a Markdown bomb

Syntax highlighting, 6376 6464/256 ≈ 25.25 +0.34375 thanks to Ismael Miguel (using a tab instead of 4 spaces)! This uses the shortest (unfortunately spaces seem to matter) annotation to get syntax-...
ბიმო's user avatar
  • 16.8k
14 votes

Keep PPCG running in Game of Life

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 (...
Cloudy7's user avatar
  • 703
13 votes

Make a long type signature

Haskell with extensions, \$\ggg A(A(A(A(220,0),0),0),0)\$ Z::Z#Z#Z#Z#Z#Z#Z#Z#Z?Z data a?b=Z|S(a?b) type family m#n where Z#n=S n;S m#Z=m#S m;S m#S n=m#(S m#n) Try ...
dfeuer's user avatar
  • 1,167
13 votes

Golf a number bigger than Loader's number

JavaScript, D6(9) (508 501 495 492 487 485 481 478 456 452 447 bytes) ...
Naruyoko's user avatar
  • 640
13 votes

Output two numbers (Cops' thread)

Malbolge, 7 bytes. Score: 3 - 1 = 2. Cracked. D'<;_L" Outputs 3. (&a%M"o Outputs 1.
Kamila Szewczyk's user avatar
12 votes

Largest Number Printable

Ruby, \$f_{\varphi(1,0,0)}(5)\$ (non-deterministic) More precisely: \$f_{\varphi(\varphi(\varphi(\varphi(\varphi(16381,\omega^2),\omega^2),\omega^2),\omega^2),\omega^2)}(1048577)\$. ...
Simply Beautiful Art's user avatar
12 votes

Shortest terminating program whose output size exceeds Graham's number

Binary Lambda Calculus, 7.625 7.5 6.75 6.125 bytes, 61 60 54 49 bits 0100011010000110011000000101101100000011100111010 This encodes: ...
2014MELO03's user avatar
  • 1,041
12 votes

Create the slowest growing function you can in under 100 bytes

JavaScript (ES6), Inverse Ackermann Function*, 97 bytes *if I did it right ...
Stephen's user avatar
  • 14k
11 votes

Make a long type signature

Haskell, 9·2663552 − 3 (≈ 1.02·10199750) A small (“small”) improvement over xnor’s 5⋅2262144 + 5. This is 99 bytes. ...
Anders Kaseorg's user avatar
10 votes

The longest period iterating quine

PHP, period 2,100,000,000 Who would've thought that this is possible in PHP?! :-) This is actually my first ever quine and it's 99 bytes long: ...
YetiCGN's user avatar
  • 1,051
10 votes

Traceless Busy Beaver

Score: \$ A(255, 2) - 1 = (2 \uparrow^{253} 5) - 4 \$ +<+<<++>-[-[<+>>[-<[->+<]+>>]+<-]>[>]+[<]+<]>[->] \...
feersum's user avatar
  • 31.4k
10 votes

Plight of the Concorde

77 cities, 7.24 minutes (434.4 seconds) average run time on NEOS I’m a little late to the party, but I’d like to contribute a 77-node instance, weruSnowflake77. I created this instance while trying ...
Lawrence Weru's user avatar
10 votes

As close to flat as possible

Python 3, score \$\approx \frac{1}{\sqrt{8\pi\lambda}}\$ where \$\lambda \approx 9\uparrow\uparrow (9\uparrow \uparrow (9 \uparrow \uparrow (9 \uparrow \uparrow (9\uparrow\uparrow 9)))))\$ This is <...
RGS's user avatar
  • 14.1k
10 votes

Infinite ordinals from a well-ordering

Haskell, \$(\omega, 3)\$ This solution is dead simple, really can't be beat in Haskell. (<) Try it online! Haskell, \$(\omega+n,19+2\left\lfloor\log_{10}(n+1)\...
Wheat Wizard's user avatar
  • 98.8k
10 votes

Infinite ordinals from a well-ordering

Pyth, \$(ω^ω, 6)\$ >_PE_P Try it online! Compares the reversed prime factorizations of the two inputs. Pyth, \$(ε_0, 17)\$ ...
Anders Kaseorg's user avatar

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