4N7QA5YNEVRA6UYWNSDUJ4BMRCCQZCNNVDMNMGBDBMIDCOITNMCAC
V2NY3ZVOW5CKNQ7ZUYNVBLKHVVRIKXYJYBA7EPJ5JNBD52YSNEUQC
ARXU56VG4ACLTSFGWFGYZU6ZEI7WRHA7TY7IGEBKXXRHM437GS4AC
SPON6U5RKD4XUHNHLXYUQ2IVY7VGQZT4U4MHDHH7BJBMLW42CZGAC
ISKIMCRTCM4ZY34QENDO4AN7ZAKRRBPFLA5MYHXH2K6Q2WKJDZNQC
PPSVYG6ZWHZG2VE43TTNXQGNYV2TGGJLNCTSTZZUO2RYY6VP65QAC
4C6H6ZYD4SVDHKIXD76SSFYE32V3GTY75WO6OVXZTL5JA3I3XL5AC
The first part is fast, as we only have to check the items in `-50..50` range.
The second part is much harder: We use coordinate compression: Each cube
switches on and off a range of coordinates, but we do not check them one-by-one,
just keeep track of the start and end of each range. This makes this solution
much faster.
TODO: C++ version takes 220ms, but the zig one is 9s. Why?