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 20:22Victor MerckléVictor MerckléScore: 49,118Success
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 20:2349,041248,231,930238,135,0002,167,0002,117,632stderr
2Jul 3, 2026 20:2349,077248,450,168238,315,0002,164,0002,117,632stderr
3Jul 3, 2026 20:2349,100248,569,655238,441,0002,149,0002,117,632stderr
4Jul 3, 2026 20:2349,105248,539,264238,449,0002,170,0002,117,632stderr
5Jul 3, 2026 20:2349,118248,638,293238,523,0002,158,0002,117,632stderr
6Jul 3, 2026 20:2349,118248,693,895238,508,0002,175,0002,117,632stderr
7Jul 3, 2026 20:2349,192248,989,012239,033,0002,012,0002,117,632stderr
8Jul 3, 2026 20:2349,363250,164,541239,728,0002,154,0002,117,632stderr
9Jul 3, 2026 20:2349,485250,836,754240,346,0002,131,0002,117,632stderr