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 13, 2026 03:03Victor MerckléVictor MerckléScore: 52,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 03:1052,192263,356,961253,733,0002,008,0002,113,536
2Jun 13, 2026 03:1052,236263,516,010253,950,0002,008,0002,113,536
3Jun 13, 2026 03:1052,247263,626,280253,988,0002,025,0002,113,536
4Jun 13, 2026 03:1052,303263,928,265254,234,0002,055,0002,113,536
5Jun 13, 2026 03:1052,316263,983,228254,341,0002,010,0002,113,536
6Jun 13, 2026 03:1052,320264,017,304254,317,0002,053,0002,113,536
7Jun 13, 2026 03:1052,328263,973,392254,344,0002,067,0002,113,536
8Jun 13, 2026 03:1052,340264,101,740254,417,0002,053,0002,113,536
9Jun 13, 2026 03:1052,363264,142,852254,450,0002,130,0002,113,536