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 listJun 22, 2026 06:24Victor MerckléVictor MerckléScore: 50,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 06:2550,100253,607,940243,482,0002,008,0002,113,536
2Jun 22, 2026 06:2550,113253,165,389243,525,0002,029,0002,113,536
3Jun 22, 2026 06:2550,126253,490,947243,499,0002,119,0002,113,536
4Jun 22, 2026 06:2550,128253,319,170243,561,0002,071,0002,113,536
5Jun 22, 2026 06:2550,228253,764,801244,038,0002,083,0002,113,536
6Jun 22, 2026 06:2551,048257,784,746248,127,0002,010,0002,113,536
7Jun 22, 2026 06:2551,676260,911,606251,180,0002,036,0002,113,536
8Jun 22, 2026 06:2551,710261,037,383251,237,0002,145,0002,113,536
9Jun 22, 2026 06:2551,803261,468,832251,811,0002,024,0002,113,536