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:50AntonAntonScore: 204,563Success
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:50203,5341,029,074,034994,320,0002,997,0002,297,856
2Nov 6, 2025 14:50203,5641,026,171,482995,468,0001,998,0002,306,048
3Nov 6, 2025 14:50204,3551,031,454,175998,342,0002,998,0002,297,856
4Nov 6, 2025 14:50204,5071,030,052,259999,083,0003,000,0002,560,000
5Nov 6, 2025 14:50204,5631,032,661,9341,000,361,0001,998,0002,424,832
6Nov 6, 2025 14:50205,8311,038,203,7661,006,574,0001,999,0002,306,048
7Nov 6, 2025 14:50206,7041,040,648,5221,009,850,0002,999,0002,297,856
8Nov 6, 2025 14:50209,1311,051,197,0061,022,744,0001,999,0002,293,760
9Nov 6, 2025 14:50213,1721,072,610,5401,041,546,0002,998,0002,482,176