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 listJun 17, 2025 16:20Павел РатмановПавел РатмановScore: 323,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2025 16:20319,8931,591,464,4591,565,479,0001,999,0002,289,664
2Jun 17, 2025 16:20319,9091,590,870,2101,565,554,0001,999,0002,289,664
3Jun 17, 2025 16:20319,9801,591,903,7971,565,904,0001,998,0002,277,376
4Jun 17, 2025 16:20323,4981,610,434,1801,582,144,0002,998,0002,281,472
5Jun 17, 2025 16:20323,5561,614,211,1381,582,426,0002,998,0002,289,664
6Jun 17, 2025 16:20323,8371,611,579,8081,583,803,0002,997,0002,281,472
7Jun 17, 2025 16:20324,2831,620,160,8311,585,988,0002,998,0002,269,184
8Jun 17, 2025 16:20328,2161,635,173,8091,606,257,0001,999,0002,289,664
9Jun 17, 2025 16:20329,0191,637,653,7531,609,195,0002,998,0002,281,472