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 4, 2026 14:06Victor MerckléVictor MerckléScore: 47,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:0747,421240,324,891230,323,0002,040,0002,117,632stderr
2Jul 4, 2026 14:0747,429240,222,538230,379,0002,026,0002,117,632stderr
3Jul 4, 2026 14:0747,472240,420,611230,576,0002,040,0002,117,632stderr
4Jul 4, 2026 14:0747,515240,755,215230,800,0002,025,0002,117,632stderr
5Jul 4, 2026 14:0747,622241,437,139231,335,0002,013,0002,117,632stderr
6Jul 4, 2026 14:0747,642241,538,586231,426,0002,024,0002,117,632stderr
7Jul 4, 2026 14:0747,650241,643,104231,389,0002,098,0002,117,632stderr
8Jul 4, 2026 14:0747,798242,165,593232,207,0002,008,0002,117,632stderr
9Jul 4, 2026 14:0748,366245,033,236234,984,0002,013,0002,117,632stderr