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 17, 2026 14:47Josu San MartinJosu San MartinScore: 129,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 14:44125,516642,441,840611,027,0004,000,0002,281,472
2Jan 17, 2026 14:47125,530640,926,888614,095,0001,000,0002,281,472
3Jan 17, 2026 14:44125,617644,091,742612,528,0002,997,0002,281,472
4Jan 17, 2026 14:47129,013655,759,183629,162,0003,000,0002,281,472
5Jan 17, 2026 14:44129,067661,328,732629,433,0002,997,0002,281,472
6Jan 17, 2026 14:47129,321667,350,983631,674,0001,998,0002,375,680