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 21, 2022 18:55Robert BurkeRobert BurkeScore: 74,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2022 18:5570,417395,969,795345,045,11802,297,856
2Jul 21, 2022 18:5570,433401,596,691345,122,01802,293,760
3Jul 21, 2022 18:5570,458399,136,087345,245,80702,285,568
4Jul 21, 2022 18:5574,094382,936,910361,061,0002,000,0002,441,216
5Jul 21, 2022 18:5574,098384,752,748362,078,0001,000,0002,424,832
6Jul 21, 2022 18:5574,100385,655,695363,091,00002,420,736
7Jul 21, 2022 18:5574,123383,706,028363,203,00002,281,472
8Jul 21, 2022 18:5574,130384,833,169363,239,00002,424,832
9Jul 21, 2022 18:5574,134386,536,062362,256,0001,000,0002,428,928
10Jul 21, 2022 18:5574,155390,637,204363,360,00002,428,928
11Jul 21, 2022 18:5574,170386,275,438362,436,000998,0002,281,472
12Jul 21, 2022 18:5574,223386,718,459362,693,000999,0002,510,848