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 16:53AntonAntonScore: 169,257Success
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 16:53166,828849,287,720815,456,0002,001,0002,433,024
2Nov 6, 2025 16:53167,681849,283,901818,638,0002,998,0002,297,856
3Nov 6, 2025 16:53168,406851,548,959824,187,0001,000,0002,297,856
4Nov 6, 2025 16:53168,449858,756,696823,402,0001,998,0002,441,216
5Nov 6, 2025 16:53169,257857,131,317826,360,0002,997,0002,297,856
6Nov 6, 2025 16:53169,401858,320,212827,065,0003,000,0002,306,048
7Nov 6, 2025 16:53170,327857,850,843831,605,0002,998,0002,560,000
8Nov 6, 2025 16:53170,660864,461,086833,236,0003,000,0002,297,856
9Nov 6, 2025 16:53176,783894,867,294864,235,0002,000,0002,437,120