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 listJul 10, 2026 00:09Victor MerckléVictor MerckléScore: 29,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 00:1029,163150,800,122141,892,0001,010,0002,117,632stderr
2Jul 10, 2026 00:1029,311151,515,313142,614,0001,011,0002,117,632stderr
3Jul 10, 2026 00:1029,322151,766,630141,644,0002,036,0002,117,632stderr
4Jul 10, 2026 00:1029,338151,600,116142,753,0001,008,0002,117,632stderr
5Jul 10, 2026 00:1029,443152,413,254142,243,0002,032,0002,117,632stderr
6Jul 10, 2026 00:1029,461152,372,186143,351,0001,010,0002,117,632stderr
7Jul 10, 2026 00:1029,482152,582,814143,457,0001,008,0002,117,632stderr
8Jul 10, 2026 00:1029,493152,600,842143,509,0001,010,0002,117,632stderr
9Jul 10, 2026 00:1029,498152,479,342143,533,0001,010,0002,117,632stderr