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 listAug 3, 2026 21:18anboto1anboto1Score: 57,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:1957,547291,063,166280,822,0001,162,0002,113,536
2Aug 3, 2026 21:1957,549290,383,410280,894,0001,099,0002,113,536
3Aug 3, 2026 21:1957,563291,199,219280,869,0001,193,0002,113,536
4Aug 3, 2026 21:1957,571291,216,633281,000,0001,100,0002,113,536
5Aug 3, 2026 21:1957,607291,381,751281,183,0001,095,0002,113,536
6Aug 3, 2026 21:1957,614291,328,023281,096,0001,214,0002,113,536
7Aug 3, 2026 21:1957,731292,053,152281,781,0001,102,0002,113,536
8Aug 3, 2026 21:1957,851293,392,478282,286,0001,187,0002,113,536
9Aug 3, 2026 21:1959,048298,387,835288,240,0001,099,0002,113,536