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 12:43Victor MerckléVictor MerckléScore: 47,325Success
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 12:4347,193239,069,451229,201,0002,046,0002,117,632stderr
2Jul 4, 2026 12:4347,211239,090,325230,326,0001,008,0002,117,632stderr
3Jul 4, 2026 12:4347,236239,215,879230,449,0001,008,0002,117,632stderr
4Jul 4, 2026 12:4347,296239,488,415229,670,0002,084,0002,117,632stderr
5Jul 4, 2026 12:4347,325239,910,709229,857,0002,038,0002,117,632stderr
6Jul 4, 2026 12:4347,326239,971,965229,846,0002,055,0002,117,632stderr
7Jul 4, 2026 12:4347,344241,494,181229,970,0002,018,0002,117,632stderr
8Jul 4, 2026 12:4347,371239,929,040230,084,0002,034,0002,117,632stderr
9Jul 4, 2026 12:4347,822242,291,539232,260,0002,069,0002,117,632stderr