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 listMar 20, 2026 21:45Pavel SkripkinPavel SkripkinScore: 200,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 21:45200,1461,004,012,147979,714,000999,0002,277,376
2Mar 20, 2026 21:45200,1981,005,657,500979,969,000999,0002,433,024
3Mar 20, 2026 21:45200,2801,007,419,608980,374,000999,0002,277,376
4Mar 20, 2026 21:45200,3281,002,332,061980,607,000999,0002,277,376
5Mar 20, 2026 21:45200,4541,005,566,029979,230,0002,997,0002,424,832
6Mar 20, 2026 21:45200,5331,005,527,863981,613,000999,0002,433,024
7Mar 20, 2026 21:45200,5401,007,544,756979,647,0002,998,0002,428,928
8Mar 20, 2026 21:45200,6801,011,933,473981,336,0001,998,0002,273,280
9Mar 20, 2026 21:45200,8261,016,643,299983,049,000998,0002,273,280