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 20, 2026 02:18Victor MerckléVictor MerckléScore: 49,442Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 02:1949,322249,337,965239,593,0002,086,0002,113,536
2Jun 20, 2026 02:1949,382249,635,565239,859,0002,114,0002,113,536
3Jun 20, 2026 02:1949,395249,686,974239,857,0002,181,0002,113,536
4Jun 20, 2026 02:1949,414249,805,415240,026,0002,106,0002,113,536
5Jun 20, 2026 02:1949,442250,260,575240,216,0002,053,0002,113,536
6Jun 20, 2026 02:1949,675250,897,606241,394,0002,016,0002,113,536
7Jun 20, 2026 02:1950,224253,817,064243,943,0002,159,0002,113,536
8Jun 20, 2026 02:1950,788256,906,122246,841,0002,022,0002,113,536
9Jun 20, 2026 02:1951,168258,130,197248,718,0002,006,0002,113,536