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 12, 2026 20:23Victor MerckléVictor MerckléScore: 154,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 20:26154,640766,477,416755,730,0002,006,0002,150,400
2May 12, 2026 20:26154,643766,495,155755,750,0002,005,0002,170,880
3May 12, 2026 20:26154,646766,292,476755,765,0002,005,0002,170,880
4May 12, 2026 20:26154,648766,655,223755,768,0002,009,0002,134,016
5May 12, 2026 20:26154,650766,287,852755,786,0002,003,0002,129,920
6May 12, 2026 20:26154,651766,521,166755,789,0002,005,0002,129,920
7May 12, 2026 20:26154,668766,642,417755,869,0002,006,0002,129,920
8May 12, 2026 20:26154,679766,907,059755,920,0002,009,0002,129,920
9May 12, 2026 20:26154,713766,999,724755,075,0003,022,0002,129,920