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 04:16Josu San MartinJosu San MartinScore: 37,429Success
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 04:1737,005189,677,539180,140,0001,188,0002,113,536
2Aug 3, 2026 04:1737,243190,874,915181,307,0001,186,0002,113,536
3Aug 3, 2026 04:1737,355191,204,588181,842,0001,201,0002,113,536
4Aug 3, 2026 04:1737,375191,635,764181,948,0001,191,0002,113,536
5Aug 3, 2026 04:1737,429191,799,429182,219,0001,186,0002,113,536
6Aug 3, 2026 04:1737,445191,822,362182,467,0001,014,0002,113,536
7Aug 3, 2026 04:1737,478192,693,312182,451,0001,193,0002,113,536
8Aug 3, 2026 04:1737,669193,044,561183,523,0001,056,0002,113,536
9Aug 3, 2026 04:1737,714193,802,240183,766,0001,035,0002,113,536