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 5, 2026 21:26Victor MerckléVictor MerckléScore: 33,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:2733,637172,868,376163,816,0001,006,0002,117,632stderr
2Jul 5, 2026 21:2733,690172,888,937164,079,0001,006,0002,117,632stderr
3Jul 5, 2026 21:2733,695173,111,934164,100,0001,006,0002,117,632stderr
4Jul 5, 2026 21:2733,705172,937,535164,151,0001,006,0002,117,632stderr
5Jul 5, 2026 21:2733,954174,288,988165,368,0001,007,0002,117,632stderr
6Jul 5, 2026 21:2733,957174,161,961165,385,0001,006,0002,117,632stderr
7Jul 5, 2026 21:2734,024174,563,598165,714,0001,005,0002,117,632stderr
8Jul 5, 2026 21:2734,070174,831,214165,939,0001,006,0002,117,632stderr
9Jul 5, 2026 21:2734,363176,143,993167,377,0001,006,0002,117,632stderr