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 listJun 25, 2026 13:14Victor MerckléVictor MerckléScore: 59,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 13:1459,691300,162,337290,382,0002,104,0002,113,536
2Jun 25, 2026 13:1459,693300,540,111290,370,0002,127,0002,113,536
3Jun 25, 2026 13:1459,706300,599,418290,466,0002,097,0002,113,536
4Jun 25, 2026 13:1459,762300,496,021290,686,0002,150,0002,113,536
5Jun 25, 2026 13:1459,817300,781,312290,976,0002,131,0002,113,536
6Jun 25, 2026 13:1459,820301,208,401291,110,0002,012,0002,113,536
7Jun 25, 2026 13:1459,822300,795,517290,971,0002,161,0002,113,536
8Jun 25, 2026 13:1459,843300,943,269291,105,0002,129,0002,113,536
9Jun 25, 2026 13:1459,953301,870,824291,632,0002,138,0002,113,536