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:07Robert BurkeRobert BurkeScore: 71,639Success
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:0768,198382,676,057334,168,11502,293,760
2Jul 22, 2022 00:0768,213394,053,742334,241,57202,285,568
3Jul 22, 2022 00:0768,257392,110,698334,460,01702,289,664
4Jul 22, 2022 00:0771,615376,206,025348,914,0001,999,0002,281,472
5Jul 22, 2022 00:0771,623374,443,860348,955,0001,999,0002,424,832
6Jul 22, 2022 00:0771,624372,327,448349,958,000999,0002,281,472
7Jul 22, 2022 00:0771,639376,131,503350,032,0001,000,0002,428,928
8Jul 22, 2022 00:0771,649374,401,394350,080,0001,000,0002,281,472
9Jul 22, 2022 00:0771,658380,673,560351,125,00002,281,472
10Jul 22, 2022 00:0771,672374,173,191350,195,0001,000,0002,281,472
11Jul 22, 2022 00:0771,696370,413,554351,312,00002,428,928
12Jul 22, 2022 00:0786,500442,513,748422,850,000999,0002,420,736