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 listJul 22, 2022 00:03Robert BurkeRobert BurkeScore: 70,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2022 00:0368,169392,500,837334,027,66602,293,760
2Jul 22, 2022 00:0368,230394,124,256334,326,51802,285,568
3Jul 22, 2022 00:0370,298370,035,326344,458,00002,420,736
4Jul 22, 2022 00:0370,333368,061,540343,633,000998,0002,281,472
5Jul 22, 2022 00:0370,380366,916,153343,863,000999,0002,281,472
6Jul 22, 2022 00:0370,387369,665,204344,898,00002,433,024
7Jul 22, 2022 00:0370,420367,278,592344,058,0001,000,0002,281,472
8Jul 22, 2022 00:0370,438372,753,491345,144,00002,281,472
9Jul 22, 2022 00:0370,624368,994,264345,058,0001,000,0002,428,928
10Jul 22, 2022 00:0370,629367,382,321345,084,0001,000,0002,281,472
11Jul 22, 2022 00:0370,771371,044,980345,778,000999,0002,281,472
12Jul 22, 2022 00:0380,083459,445,597392,407,34002,289,664