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 3, 2026 07:44Victor MerckléVictor MerckléScore: 48,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 3, 2026 07:4648,525245,748,478235,664,0002,109,0002,117,632stderr
2Jul 3, 2026 07:4648,593246,026,583236,045,0002,061,0002,117,632stderr
3Jul 3, 2026 07:4648,614246,129,982236,112,0002,097,0002,117,632stderr
4Jul 3, 2026 07:4648,617246,178,218236,199,0002,028,0002,117,632stderr
5Jul 3, 2026 07:4648,657246,368,891236,246,0002,175,0002,117,632stderr
6Jul 3, 2026 07:4648,664246,478,517236,416,0002,038,0002,117,632stderr
7Jul 3, 2026 07:4648,667246,187,756236,353,0002,118,0002,117,632stderr
8Jul 3, 2026 07:4649,133248,639,481238,664,0002,089,0002,117,632stderr
9Jul 3, 2026 07:4649,250249,256,727239,226,0002,099,0002,117,632stderr