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 24, 2026 14:23Andrew EpsteinAndrew EpsteinScore: 336,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 14:24335,0581,652,290,3211,640,677,0001,109,0002,117,632stderr
2Sep 24, 2026 14:24335,7431,656,402,4241,644,040,0001,101,0002,117,632stderr
3Sep 24, 2026 14:24335,9631,656,767,8181,645,108,0001,115,0002,117,632stderr
4Sep 24, 2026 14:24336,2551,658,105,1981,646,549,0001,105,0002,117,632stderr
5Sep 24, 2026 14:24336,2601,658,841,1781,646,566,0001,111,0002,117,632stderr
6Sep 24, 2026 14:24336,6331,660,159,6081,647,061,0002,444,0002,117,632stderr
7Sep 24, 2026 14:24336,7501,661,225,7831,648,964,0001,115,0002,117,632stderr
8Sep 24, 2026 14:24336,8101,660,957,7411,649,076,0001,297,0002,117,632stderr
9Sep 24, 2026 14:24358,2801,766,199,1971,754,471,0001,103,0002,117,632stderr