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 listMay 11, 2026 14:48Victor MerckléVictor MerckléScore: 96,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 14:5096,596482,095,670471,235,0002,090,0002,113,536
2May 11, 2026 14:5096,626482,285,037471,434,0002,034,0002,113,536
3May 11, 2026 14:5096,640484,312,071471,305,0002,231,0002,113,536
4May 11, 2026 14:5096,667484,394,746471,542,0002,130,0002,113,536
5May 11, 2026 14:5096,674483,214,028471,468,0002,239,0002,113,536
6May 11, 2026 14:5096,685485,445,361471,594,0002,163,0002,113,536
7May 11, 2026 14:5096,717484,639,017471,753,0002,165,0002,113,536
8May 11, 2026 14:5096,746485,821,887471,923,0002,136,0002,113,536
9May 11, 2026 14:5097,281486,428,806474,655,0002,024,0002,113,536