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:35AntonAntonScore: 206,713Success
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:35203,4571,023,677,089993,940,0002,999,0002,297,856
2Nov 6, 2025 14:35203,4961,027,204,757995,130,0002,000,0002,301,952
3Nov 6, 2025 14:35204,6211,027,796,156999,646,0002,998,0002,433,024
4Nov 6, 2025 14:35205,9751,037,333,5811,006,279,0002,997,0002,469,888
5Nov 6, 2025 14:35206,7131,046,294,8031,010,896,0001,999,0002,306,048
6Nov 6, 2025 14:35208,4171,049,769,5891,019,243,0001,998,0002,306,048
7Nov 6, 2025 14:35209,0321,052,175,3171,021,261,0002,997,0002,297,856
8Nov 6, 2025 14:35214,6371,082,371,2011,048,723,0002,999,0002,453,504
9Nov 6, 2025 14:35214,8631,078,674,6191,050,830,0001,999,0002,306,048