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 3, 2026 07:16Victor MerckléVictor MerckléScore: 48,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 07:1748,670246,422,789236,450,0002,035,0002,117,632stderr
2Jul 3, 2026 07:1748,695246,919,817236,553,0002,057,0002,117,632stderr
3Jul 3, 2026 07:1748,714246,593,887236,681,0002,019,0002,117,632stderr
4Jul 3, 2026 07:1748,759247,217,828236,909,0002,012,0002,117,632stderr
5Jul 3, 2026 07:1748,773246,909,451236,918,0002,073,0002,117,632stderr
6Jul 3, 2026 07:1748,778246,996,704236,981,0002,033,0002,117,632stderr
7Jul 3, 2026 07:1748,819247,112,912237,210,0002,005,0002,117,632stderr
8Jul 3, 2026 07:1748,944247,823,531237,708,0002,119,0002,117,632stderr
9Jul 3, 2026 07:1748,997247,991,970238,054,0002,032,0002,117,632stderr