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 5, 2026 20:41Victor MerckléVictor MerckléScore: 38,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:4238,123194,894,818185,796,0001,007,0002,117,632stderr
2Jul 5, 2026 20:4238,337195,938,556186,847,0001,006,0002,117,632stderr
3Jul 5, 2026 20:4238,440196,457,039186,337,0002,020,0002,117,632stderr
4Jul 5, 2026 20:4238,470196,352,803187,498,0001,006,0002,117,632stderr
5Jul 5, 2026 20:4238,474196,570,770187,520,0001,007,0002,117,632stderr
6Jul 5, 2026 20:4238,477196,637,715187,533,0001,007,0002,117,632stderr
7Jul 5, 2026 20:4238,622197,247,746188,246,0001,006,0002,117,632stderr
8Jul 5, 2026 20:4238,629197,088,402187,236,0002,048,0002,117,632stderr
9Jul 5, 2026 20:4238,651197,381,065188,385,0001,006,0002,117,632stderr