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 12:35Victor MerckléVictor MerckléScore: 49,121Success
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 12:3548,971247,903,046237,941,0002,019,0002,117,632stderr
2Jul 5, 2026 12:3549,000248,093,800238,068,0002,033,0002,117,632stderr
3Jul 5, 2026 12:3549,102248,584,860238,587,0002,017,0002,117,632stderr
4Jul 5, 2026 12:3549,111248,618,160238,611,0002,037,0002,117,632stderr
5Jul 5, 2026 12:3549,121248,791,961238,656,0002,039,0002,117,632stderr
6Jul 5, 2026 12:3549,156248,942,104238,789,0002,078,0002,117,632stderr
7Jul 5, 2026 12:3549,177248,923,825238,907,0002,062,0002,117,632stderr
8Jul 5, 2026 12:3549,219249,147,068239,141,0002,033,0002,117,632stderr
9Jul 5, 2026 12:3549,240249,199,674239,251,0002,029,0002,117,632stderr