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:06Robert BurkeRobert BurkeScore: 70,855Success
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:0667,719403,592,403331,822,48102,289,664
2Jul 22, 2022 00:0667,752390,987,780331,986,47902,293,760
3Jul 22, 2022 00:0667,762401,273,958332,036,16702,289,664
4Jul 22, 2022 00:0670,815367,041,180344,996,0001,999,0002,428,928
5Jul 22, 2022 00:0670,829368,590,821346,063,0001,000,0002,424,832
6Jul 22, 2022 00:0670,849372,634,369347,161,00002,281,472
7Jul 22, 2022 00:0670,855372,438,605347,189,00002,281,472
8Jul 22, 2022 00:0670,855365,864,228347,190,00002,514,944
9Jul 22, 2022 00:0670,863369,003,531346,230,0001,000,0002,433,024
10Jul 22, 2022 00:0670,868371,654,172346,251,0001,000,0002,281,472
11Jul 22, 2022 00:0670,868367,368,282346,253,0001,000,0002,514,944
12Jul 22, 2022 00:0670,875369,257,755347,286,00002,428,928