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 listJun 22, 2026 05:56Victor MerckléVictor MerckléScore: 55,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 05:5755,501280,060,671269,805,0002,151,0002,113,536
2Jun 22, 2026 05:5755,525279,624,697269,984,0002,089,0002,113,536
3Jun 22, 2026 05:5755,532279,797,075270,048,0002,062,0002,113,536
4Jun 22, 2026 05:5755,548279,690,739270,138,0002,049,0002,113,536
5Jun 22, 2026 05:5755,676280,328,171270,763,0002,053,0002,113,536
6Jun 22, 2026 05:5755,705280,980,750270,825,0002,131,0002,113,536
7Jun 22, 2026 05:5757,031286,954,559277,357,0002,098,0002,113,536
8Jun 22, 2026 05:5758,202292,655,656283,118,0002,073,0002,113,536
9Jun 22, 2026 05:5758,255293,581,958283,323,0002,128,0002,113,536