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 7, 2026 18:36Victor MerckléVictor MerckléScore: 34,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 18:3733,680172,852,406157,003,0008,030,00024,576stderr
2Jul 7, 2026 18:3733,779173,494,746157,591,0007,928,00024,576stderr
3Jul 7, 2026 18:3733,888175,687,196157,033,0009,021,00024,576stderr
4Jul 7, 2026 18:3734,005174,471,239157,277,0009,349,00024,576stderr
5Jul 7, 2026 18:3734,062174,721,368158,488,0008,419,0002,117,632stderr
6Jul 7, 2026 18:3734,292176,152,125157,673,00010,360,00024,576stderr
7Jul 7, 2026 18:3734,371176,203,924158,500,0009,920,00024,576stderr
8Jul 7, 2026 18:3734,372183,345,871157,866,00010,559,0002,117,632stderr
9Jul 7, 2026 18:3734,888178,964,800159,703,00011,252,0002,117,632stderr