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 8, 2026 10:54Victor MerckléVictor MerckléScore: 31,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 10:5531,474162,293,106153,218,0001,009,0002,117,632stderr
2Jul 8, 2026 10:5531,474163,695,180153,214,0001,010,0002,117,632stderr
3Jul 8, 2026 10:5531,590162,716,036153,785,0001,009,0002,117,632stderr
4Jul 8, 2026 10:5531,593163,008,119152,795,0002,014,0002,117,632stderr
5Jul 8, 2026 10:5531,606162,760,683153,861,0001,010,0002,117,632stderr
6Jul 8, 2026 10:5531,661163,015,726154,132,0001,011,0002,117,632stderr
7Jul 8, 2026 10:5531,769163,766,952154,661,0001,009,0002,117,632stderr
8Jul 8, 2026 10:5531,817163,899,898154,896,0001,012,0002,117,632stderr
9Jul 8, 2026 10:5532,148165,368,604155,491,0002,037,0002,117,632stderr