Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listSep 25, 2026 16:49Andrew EpsteinAndrew EpsteinScore: 150,714Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 16:50148,555738,520,855719,950,0007,972,00024,576stderr
2Sep 25, 2026 16:50150,299746,871,111735,349,0001,119,0002,117,632stderr
3Sep 25, 2026 16:50150,480747,860,979734,496,0002,860,0002,117,632stderr
4Sep 25, 2026 16:50150,506748,568,997734,456,0003,025,0002,117,632stderr
5Sep 25, 2026 16:50150,714749,009,177737,382,0001,120,0002,117,632stderr
6Sep 25, 2026 16:50151,164751,269,018739,590,0001,115,0002,117,632stderr
7Sep 25, 2026 16:50151,382752,822,887738,712,0003,064,0002,117,632stderr
8Sep 25, 2026 16:50151,570753,121,013734,547,0008,146,00024,576stderr
9Sep 25, 2026 16:50151,696753,773,664734,611,0008,703,00024,576stderr