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 listJul 5, 2026 18:55Victor MerckléVictor MerckléScore: 37,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 18:5637,826193,333,476181,747,0003,603,0002,117,632stderr
2Jul 5, 2026 18:5637,853193,283,404182,293,0003,189,00024,576stderr
3Jul 5, 2026 18:5637,858193,583,267182,406,0003,102,00024,576stderr
4Jul 5, 2026 18:5637,885193,492,379182,340,0003,301,00024,576stderr
5Jul 5, 2026 18:5637,901193,692,878182,323,0003,393,00024,576stderr
6Jul 5, 2026 18:5637,907193,701,471182,409,0003,337,00024,576stderr
7Jul 5, 2026 18:5637,939193,911,334182,757,0003,148,00024,576stderr
8Jul 5, 2026 18:5638,007195,842,412182,779,0003,457,00024,576stderr
9Jul 5, 2026 18:5638,371196,048,530184,188,0003,834,0002,117,632stderr