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 3, 2026 14:17Victor MerckléVictor MerckléScore: 26,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 14:1726,427137,992,593128,464,0001,033,0002,117,632stderr
2Sep 3, 2026 14:1726,448138,291,841128,493,0001,106,0002,117,632stderr
3Sep 3, 2026 14:1726,454138,090,740128,500,0001,125,0002,117,632stderr
4Sep 3, 2026 14:1726,455138,001,721128,517,0001,117,0002,117,632stderr
5Sep 3, 2026 14:1726,461138,065,560128,563,0001,099,0002,117,632stderr
6Sep 3, 2026 14:1726,464138,129,708128,577,0001,098,0002,117,632stderr
7Sep 3, 2026 14:1726,469138,220,697128,591,0001,108,0002,117,632stderr
8Sep 3, 2026 14:1726,481138,234,934128,598,0001,161,0002,117,632stderr
9Sep 3, 2026 14:1726,484141,210,215128,613,0001,159,0002,117,632stderr