Solving the web most popular code shortening competition in Python.
summary
Solves SIZECON by shrinking Python until only characters above ASCII 32 count and reaches a record 28 characters above 32. Uses low-level tricks: translate() tables to remap control bytes, octal literals and backslash escapes to compose arbitrary bytes, layered string execs (an nested exec inception) to build and run code, plus custom search and generation tools that enumerate feasible character sets. Submissions are binary files uploaded to SPOJ and verified to run and score.
AI-written summary · about
chapters (9)
- 0:00Start
- 5:55SIZECON problem statement SIZECON - Size Contest
- 7:04SIZECON best solutions for Python 2
- 8:17The "python golf" master plan
- 9:32Reference solutions - 50-ish
- 11:04Shortened solutions - down to 33!
- 17:49Building ASC1132_decrypt
- 22:10"SIZECON2" problem Same as SIZECON, but score is the number of different characters with ASCII 32
- 25:09"SIZECON2" problem Octal representation of characters in literal strings!
