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:38anboto1anboto1Score: 57,572Success
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:3957,519290,345,333280,711,0001,134,0002,113,536
2Aug 3, 2026 21:3957,527290,358,253280,784,0001,100,0002,113,536
3Aug 3, 2026 21:3957,550291,115,205280,876,0001,120,0002,113,536
4Aug 3, 2026 21:3957,568290,580,893280,900,0001,184,0002,113,536
5Aug 3, 2026 21:3957,572291,191,548281,008,0001,095,0002,113,536
6Aug 3, 2026 21:3957,659291,002,475281,516,0001,016,0002,113,536
7Aug 3, 2026 21:3957,699291,893,163281,537,0001,190,0002,113,536
8Aug 3, 2026 21:3958,239293,929,360284,296,0001,078,0002,113,536
9Aug 3, 2026 21:3959,092298,045,198288,396,0001,156,0002,113,536