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 18:40Victor MerckléVictor MerckléScore: 41,213Success
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 18:4139,604201,886,876189,928,0004,133,00024,576stderr
2Jul 5, 2026 18:4139,647202,278,670190,434,0003,839,00024,576stderr
3Jul 5, 2026 18:4139,666202,185,750190,349,0004,016,00024,576stderr
4Jul 5, 2026 18:4140,703207,335,824195,549,0003,896,00024,576stderr
5Jul 5, 2026 18:4141,213209,940,811198,134,0003,811,00024,576stderr
6Jul 5, 2026 18:4141,447210,909,390199,063,0004,028,00028,672stderr
7Jul 5, 2026 18:4141,544211,329,127199,237,0004,330,00024,576stderr
8Jul 5, 2026 18:4142,123214,528,096202,718,0003,686,00024,576stderr
9Jul 5, 2026 18:4142,217214,728,607203,233,0003,634,00024,576stderr