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 31, 2026 18:53anboto1anboto1Score: 449,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:54449,5632,212,920,4432,201,853,0001,006,0002,113,536
2Jul 31, 2026 18:54449,5662,212,938,1852,201,872,0001,002,0002,113,536
3Jul 31, 2026 18:54449,5682,212,929,1752,201,862,0001,023,0002,113,536
4Jul 31, 2026 18:54449,5832,213,092,7312,201,955,0001,002,0002,113,536
5Jul 31, 2026 18:54449,5882,213,179,3812,201,981,0001,002,0002,113,536
6Jul 31, 2026 18:54449,5892,213,082,1652,201,953,0001,035,0002,113,536
7Jul 31, 2026 18:54449,7292,213,844,5932,201,646,0002,030,0002,113,536
8Jul 31, 2026 18:54449,8612,214,357,7482,203,303,0001,016,0002,113,536
9Jul 31, 2026 18:54449,8682,214,471,0192,203,347,0001,007,0002,113,536