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 13:56Victor MerckléVictor MerckléScore: 48,746Success
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 13:5748,467245,562,120235,467,0002,025,0002,117,632stderr
2Jul 4, 2026 13:5748,493245,597,865235,582,0002,036,0002,117,632stderr
3Jul 4, 2026 13:5748,508245,736,821235,655,0002,037,0002,117,632stderr
4Jul 4, 2026 13:5748,583246,017,481236,040,0002,019,0002,117,632stderr
5Jul 4, 2026 13:5748,746246,881,723236,847,0002,011,0002,117,632stderr
6Jul 4, 2026 13:5748,772247,034,548236,959,0002,028,0002,117,632stderr
7Jul 4, 2026 13:5748,803247,138,012237,099,0002,037,0002,117,632stderr
8Jul 4, 2026 13:5749,823252,098,263242,118,0002,016,0002,117,632stderr
9Jul 4, 2026 13:5749,861252,281,339242,308,0002,013,0002,117,632stderr