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 21:41anboto1anboto1Score: 136,150Success
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 21:42135,063672,080,983660,459,0001,352,0002,113,536
2Jul 31, 2026 21:42135,312673,945,401661,661,0001,369,0002,113,536
3Jul 31, 2026 21:42135,457673,945,269662,383,0001,357,0002,113,536
4Jul 31, 2026 21:42135,873676,663,236664,401,0001,380,0002,113,536
5Jul 31, 2026 21:42136,150678,085,361665,757,0001,378,0002,113,536
6Jul 31, 2026 21:42136,235678,443,657666,190,0001,365,0002,113,536
7Jul 31, 2026 21:42136,697680,659,978668,449,0001,371,0002,113,536
8Jul 31, 2026 21:42136,761680,453,788668,768,0001,361,0002,113,536
9Jul 31, 2026 21:42136,887681,635,206669,389,0001,360,0002,113,536