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 19:21anboto1anboto1Score: 174,007Success
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 19:22173,714861,326,276850,189,0001,010,0002,113,536
2Jul 31, 2026 19:22173,847861,792,480850,852,0001,002,0002,113,536
3Jul 31, 2026 19:22173,874863,147,219850,981,0001,004,0002,113,536
4Jul 31, 2026 19:22173,926862,415,480851,241,0001,001,0002,113,536
5Jul 31, 2026 19:22174,007863,444,636851,635,0001,004,0002,113,536
6Jul 31, 2026 19:22174,090863,791,123852,043,0001,002,0002,113,536
7Jul 31, 2026 19:22174,141864,151,136852,290,0001,003,0002,113,536
8Jul 31, 2026 19:22174,353864,352,464853,323,0001,010,0002,113,536
9Jul 31, 2026 19:22175,634870,690,520859,599,0001,011,0002,113,536