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 8, 2026 13:27Victor MerckléVictor MerckléScore: 32,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 13:2832,190165,768,496153,062,0004,669,0002,117,632stderr
2Jul 8, 2026 13:2832,472166,986,579153,933,0005,183,00024,576stderr
3Jul 8, 2026 13:2832,724168,384,581154,009,0006,341,00024,576stderr
4Jul 8, 2026 13:2832,730168,483,902153,983,0006,395,0002,117,632stderr
5Jul 8, 2026 13:2832,813168,619,797153,754,0007,033,00024,576stderr
6Jul 8, 2026 13:2833,120170,322,644154,443,0007,846,0002,117,632stderr
7Jul 8, 2026 13:2833,277171,163,354155,210,0007,850,0002,117,632stderr
8Jul 8, 2026 13:2833,515172,381,365156,417,0007,807,0002,117,632stderr
9Jul 8, 2026 13:2833,774173,437,505156,183,0009,311,0002,117,632stderr