Skip to content
← Back to Community
I found the fastest way to break Repl.it
Profile icon
AtriDey

I was bored and was playing with exponents. C++ variables hit inf in under a second. I turned to Python and made this monstrosity.

Repl.it gets a PyMark score of 4. Comment F to pay respects to your computer.

Voters
Profile icon
AtriDey
Comments
hotnewtop
Profile icon
Highwayman

Hm...
256 == 2^8
One byte can hold up to 2^8 - 1
256^256 == 2^(8^(2^8)) == (2^8)^(2^8) == 2^(8 * 2^8) == 2^(2^3 * 2^8) == 2^(2^11).
2^10 == 1024, 2^11 == 2048.
2^(2^11) == 2^2048.
g d. That’s a lot of bits.
That’s a 257 byte integer. The system of repl.it only has a data type as big as 128 bits. 2048 bit integer is like 16 times that size. Yeesh.

Profile icon
ShubhanPoojari

it is not broken lol