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 10, 2026 00:39Victor MerckléVictor MerckléScore: 34,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 00:4033,915174,335,934164,112,0002,073,0002,117,632stderr
2Jul 10, 2026 00:4034,036174,945,080164,601,0002,177,0002,117,632stderr
3Jul 10, 2026 00:4034,161175,476,406165,192,0002,197,0002,117,632stderr
4Jul 10, 2026 00:4034,222175,753,308165,631,0002,061,0002,117,632stderr
5Jul 10, 2026 00:4034,229175,788,902165,627,0002,097,0002,117,632stderr
6Jul 10, 2026 00:4034,329176,450,669166,074,0002,140,0002,117,632stderr
7Jul 10, 2026 00:4034,395176,665,096166,365,0002,175,0002,117,632stderr
8Jul 10, 2026 00:4034,457176,675,759166,614,0002,230,0002,117,632stderr
9Jul 10, 2026 00:4034,467177,030,300166,776,0002,117,0002,117,632stderr