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 listDec 16, 2024 19:53Joad NacerJoad NacerScore: 239,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2024 19:53239,2811,197,971,1691,170,480,0001,999,0002,420,736
2Dec 16, 2024 19:53239,3001,196,978,9171,171,572,000999,0002,428,928
3Dec 16, 2024 19:53239,3071,193,149,7081,170,603,0001,999,0002,412,544
4Dec 16, 2024 19:53239,3651,199,005,9351,171,890,000999,0002,531,328
5Dec 16, 2024 19:53239,3781,203,992,3901,172,951,00002,531,328
6Dec 16, 2024 19:53239,3951,195,920,0661,173,034,00002,420,736
7Dec 16, 2024 19:53239,4071,198,944,0751,172,093,000999,0002,269,184
8Dec 16, 2024 19:53239,4081,198,589,3781,172,102,000999,0002,424,832
9Dec 16, 2024 19:53239,4201,197,117,8551,171,159,0001,998,0002,420,736