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 14, 2026 04:26Victor MerckléVictor MerckléScore: 35,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 04:2734,832178,580,870169,674,0001,006,0002,117,632stderr
2Jul 14, 2026 04:2734,877179,560,576169,892,0001,007,0002,117,632stderr
3Jul 14, 2026 04:2734,946179,330,367170,232,0001,007,0002,117,632stderr
4Jul 14, 2026 04:2735,066179,945,044170,820,0001,007,0002,117,632stderr
5Jul 14, 2026 04:2735,097180,152,193170,974,0001,005,0002,117,632stderr
6Jul 14, 2026 04:2735,129180,224,597171,129,0001,007,0002,117,632stderr
7Jul 14, 2026 04:2735,130180,234,181171,136,0001,005,0002,117,632stderr
8Jul 14, 2026 04:2735,202180,353,854170,473,0002,021,0002,117,632stderr
9Jul 14, 2026 04:2735,429181,717,601172,599,0001,007,0002,117,632stderr