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:25Victor MerckléVictor MerckléScore: 33,035Success
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:2632,559167,629,812154,355,0005,188,00024,576stderr
2Jul 8, 2026 10:2632,628167,782,944154,832,0005,049,00024,576stderr
3Jul 8, 2026 10:2632,962169,379,802155,790,0005,724,00024,576stderr
4Jul 8, 2026 10:2633,001169,586,973155,395,0006,310,0002,117,632stderr
5Jul 8, 2026 10:2633,035169,729,055155,804,0006,069,00024,576stderr
6Jul 8, 2026 10:2633,141170,229,657157,153,0005,239,0002,117,632stderr
7Jul 8, 2026 10:2634,176175,356,786156,564,00010,903,00024,576stderr
8Jul 8, 2026 10:2634,257175,806,415158,785,0009,079,00024,576stderr
9Jul 8, 2026 10:2634,844178,626,868159,516,00011,220,00024,576stderr