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:32anboto1anboto1Score: 58,165Success
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:3257,797291,712,766282,111,0001,095,0002,113,536
2Aug 3, 2026 21:3257,813291,772,582282,123,0001,162,0002,113,536
3Aug 3, 2026 21:3257,908292,157,207282,724,0001,029,0002,113,536
4Aug 3, 2026 21:3258,012293,417,699283,165,0001,095,0002,113,536
5Aug 3, 2026 21:3258,165293,471,943283,844,0001,165,0002,113,536
6Aug 3, 2026 21:3258,191294,256,655284,053,0001,087,0002,113,536
7Aug 3, 2026 21:3258,256296,333,728284,444,0001,011,0002,113,536
8Aug 3, 2026 21:3258,475295,692,892285,364,0001,168,0002,113,536
9Aug 3, 2026 21:3259,050297,856,650288,208,0001,139,0002,113,536