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 20:56Victor MerckléVictor MerckléScore: 34,671Success
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 20:5734,431178,243,047167,709,0001,005,0002,117,632stderr
2Jul 5, 2026 20:5734,483176,825,007167,963,0001,007,0002,117,632stderr
3Jul 5, 2026 20:5734,491177,113,612168,000,0001,006,0002,117,632stderr
4Jul 5, 2026 20:5734,492177,168,142168,005,0001,007,0002,117,632stderr
5Jul 5, 2026 20:5734,671177,915,884168,883,0001,007,0002,117,632stderr
6Jul 5, 2026 20:5734,692178,024,062168,984,0001,007,0002,117,632stderr
7Jul 5, 2026 20:5734,758178,379,557169,309,0001,007,0002,117,632stderr
8Jul 5, 2026 20:5734,893178,996,429169,972,0001,005,0002,117,632stderr
9Jul 5, 2026 20:5734,907179,081,500170,041,0001,006,0002,117,632stderr