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 13, 2026 16:58Tomislav TunkovicTomislav TunkovicScore: 154,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 16:58152,243755,257,926744,991,0001,001,0002,121,728stderr
2Aug 13, 2026 16:58154,634766,179,881756,703,0001,004,0002,121,728stderr
3Aug 13, 2026 16:58154,667766,251,440756,864,0001,005,0002,121,728stderr
4Aug 13, 2026 16:58154,687766,540,869756,967,0001,003,0002,121,728stderr
5Aug 13, 2026 16:58154,759766,794,137757,221,0001,100,0002,121,728stderr
6Aug 13, 2026 16:58154,843767,142,389757,725,0001,009,0002,121,728stderr
7Aug 13, 2026 16:58154,985767,946,434758,425,0001,003,0002,121,728stderr
8Aug 13, 2026 16:58155,022768,002,831758,604,0001,004,0002,121,728stderr
9Aug 13, 2026 16:58155,118768,507,589759,080,0001,002,0002,121,728stderr