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 15:08Victor MerckléVictor MerckléScore: 94,816Success
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 15:0994,770473,575,612462,199,0002,176,0002,113,536
2May 11, 2026 15:0994,773475,046,240462,194,0002,198,0002,113,536
3May 11, 2026 15:0994,791474,301,719462,275,0002,204,0002,113,536
4May 11, 2026 15:0994,813475,885,133462,397,0002,189,0002,113,536
5May 11, 2026 15:0994,816474,220,915462,412,0002,187,0002,113,536
6May 11, 2026 15:0994,852474,234,622462,572,0002,206,0002,113,536
7May 11, 2026 15:0994,864476,166,530462,640,0002,195,0002,113,536
8May 11, 2026 15:0996,120481,964,897468,815,0002,177,0002,113,536
9May 11, 2026 15:0996,167480,165,860468,984,0002,235,0002,113,536