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 15:25Josu San MartinJosu San MartinScore: 56,634Success
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 15:2656,595288,163,631275,108,0002,208,0002,113,536
2Jul 31, 2026 15:2656,613288,287,162275,354,0002,052,0002,113,536
3Jul 31, 2026 15:2656,618288,296,544275,407,0002,026,0002,113,536
4Jul 31, 2026 15:2656,632287,565,264275,464,0002,036,0002,121,728
5Jul 31, 2026 15:2656,634287,713,760275,475,0002,035,0002,113,536
6Jul 31, 2026 15:2656,650287,669,779275,345,0002,244,0002,113,536
7Jul 31, 2026 15:2656,695288,021,875275,781,0002,026,0002,113,536
8Jul 31, 2026 15:2656,996289,457,130277,071,0002,211,0002,113,536
9Jul 31, 2026 15:2657,208290,381,741278,112,0002,209,0002,113,536