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 17:43Victor MerckléVictor MerckléScore: 62,183Success
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 17:4461,798310,868,811298,844,0003,969,00024,576stderr
2Jul 5, 2026 17:4461,920311,456,879299,652,0003,759,00024,576stderr
3Jul 5, 2026 17:4462,019312,253,903299,009,0004,886,00024,576stderr
4Jul 5, 2026 17:4462,167312,640,455299,356,0005,265,00024,576stderr
5Jul 5, 2026 17:4462,183312,519,069299,822,0004,879,00024,576stderr
6Jul 5, 2026 17:4462,423313,947,929301,641,0004,235,00024,576stderr
7Jul 5, 2026 17:4463,818320,724,404301,683,00011,027,0002,117,632stderr
8Jul 5, 2026 17:4463,903321,135,520302,195,00010,931,0002,117,632stderr
9Jul 5, 2026 17:4463,957321,522,259302,439,00010,955,0002,117,632stderr