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 13:33Andrew EpsteinAndrew EpsteinScore: 925,650Success
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 13:35923,2694,534,451,0914,521,758,0002,261,0002,117,632stderr
2Sep 24, 2026 13:35923,7014,536,630,0764,524,135,0002,001,0002,117,632stderr
3Sep 24, 2026 13:35925,3644,545,208,0454,532,279,0002,008,0002,117,632stderr
4Sep 24, 2026 13:35925,5094,545,594,5844,532,735,0002,260,0002,117,632stderr
5Sep 24, 2026 13:35925,6504,547,734,4434,533,679,0002,010,0002,117,632stderr
6Sep 24, 2026 13:35925,6754,546,478,0414,533,799,0002,012,0002,117,632stderr
7Sep 24, 2026 13:35927,0084,552,801,0694,540,056,0002,284,0002,117,632stderr
8Sep 24, 2026 13:35927,1944,553,646,7434,540,907,0002,348,0002,117,632stderr
9Sep 24, 2026 13:35928,6834,561,007,8784,548,336,0002,211,0002,117,632stderr