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 listNov 6, 2025 14:34AntonAntonScore: 233,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2025 14:34226,8241,141,877,1951,108,441,0002,998,0002,293,760
2Nov 6, 2025 14:34227,0281,146,679,8911,110,440,0001,998,0002,547,712
3Nov 6, 2025 14:34227,7701,142,783,7941,113,071,0003,000,0002,297,856
4Nov 6, 2025 14:34232,4851,171,412,3041,136,179,0002,997,0002,535,424
5Nov 6, 2025 14:34233,4691,167,846,6061,141,000,0002,997,0002,297,856
6Nov 6, 2025 14:34237,8061,190,024,5041,162,250,0002,998,0002,547,712
7Nov 6, 2025 14:34237,9681,194,470,1641,164,043,0002,000,0002,297,856
8Nov 6, 2025 14:34240,3291,202,974,5931,175,612,0001,999,0002,297,856
9Nov 6, 2025 14:34244,4291,220,336,8031,194,705,0002,999,0002,306,048