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 listJan 18, 2026 00:48Josu San MartinJosu San MartinScore: 136,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 00:48136,034695,017,906664,568,0001,998,0002,281,472
2Jan 17, 2026 21:48136,075695,341,041663,768,0002,998,0002,269,184
3Jan 17, 2026 21:48136,133694,802,222663,050,0004,000,0002,281,472
4Jan 18, 2026 00:48136,189694,289,385663,330,0003,995,0002,281,472
5Jan 17, 2026 21:48136,869702,367,749668,659,0001,998,0002,281,472
6Jan 18, 2026 00:48140,098711,873,902683,484,0002,997,0002,277,376