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 13:40Victor MerckléVictor MerckléScore: 34,657Success
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 13:4134,566177,536,687168,372,0001,005,0002,117,632stderr
2Jul 8, 2026 13:4134,603177,617,475168,549,0001,007,0002,117,632stderr
3Jul 8, 2026 13:4134,613177,411,481168,598,0001,007,0002,117,632stderr
4Jul 8, 2026 13:4134,624177,491,562168,652,0001,006,0002,117,632stderr
5Jul 8, 2026 13:4134,657177,920,284168,817,0001,006,0002,117,632stderr
6Jul 8, 2026 13:4134,681177,777,658168,931,0001,006,0002,117,632stderr
7Jul 8, 2026 13:4134,696177,926,252167,986,0002,029,0002,117,632stderr
8Jul 8, 2026 13:4135,034179,473,793170,665,0001,006,0002,117,632stderr
9Jul 8, 2026 13:4135,116180,147,779171,064,0001,007,0002,117,632stderr