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 4, 2026 15:25Victor MerckléVictor MerckléScore: 46,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:2646,450235,574,154225,588,0002,019,0002,117,632stderr
2Jul 4, 2026 15:2646,462235,707,689225,651,0002,014,0002,117,632stderr
3Jul 4, 2026 15:2646,502235,906,253225,825,0002,037,0002,117,632stderr
4Jul 4, 2026 15:2646,555236,154,894226,053,0002,070,0002,117,632stderr
5Jul 4, 2026 15:2646,555236,170,017227,117,0001,006,0002,117,632stderr
6Jul 4, 2026 15:2646,575236,133,250226,206,0002,012,0002,117,632stderr
7Jul 4, 2026 15:2646,675236,687,334226,645,0002,067,0002,117,632stderr
8Jul 4, 2026 15:2646,753237,075,518227,055,0002,035,0002,117,632stderr
9Jul 4, 2026 15:2646,779237,147,741227,041,0002,178,0002,117,632stderr