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 13:18Victor MerckléVictor MerckléScore: 49,331Success
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 13:1949,197248,820,675240,062,0001,007,0002,117,632stderr
2Jul 4, 2026 13:1949,210249,162,871239,102,0002,027,0002,117,632stderr
3Jul 4, 2026 13:1949,248249,291,677240,309,0001,007,0002,117,632stderr
4Jul 4, 2026 13:1949,273249,392,650239,409,0002,033,0002,117,632stderr
5Jul 4, 2026 13:1949,331250,157,462240,717,0001,007,0002,117,632stderr
6Jul 4, 2026 13:1949,462250,346,166240,357,0002,009,0002,117,632stderr
7Jul 4, 2026 13:1949,881252,363,937242,383,0002,038,0002,117,632stderr
8Jul 4, 2026 13:1950,350254,994,533244,705,0002,012,0002,117,632stderr
9Jul 4, 2026 13:1951,753261,992,403251,567,0002,025,0002,117,632stderr