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 listOct 4, 2022 15:36Robert BurkeRobert BurkeScore: 55,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 4, 2022 15:3653,194320,220,407260,649,08902,179,072
2Oct 4, 2022 15:3653,293317,572,938261,134,21102,183,168
3Oct 4, 2022 15:3653,383317,544,855261,576,18502,187,264
4Oct 4, 2022 15:3655,319293,058,426269,064,0002,000,0002,445,312
5Oct 4, 2022 15:3655,348291,380,240270,205,0001,000,0002,281,472
6Oct 4, 2022 15:3655,352291,466,108270,227,0001,000,0002,437,120
7Oct 4, 2022 15:3655,374295,944,651270,333,0001,001,0002,281,472
8Oct 4, 2022 15:3655,402297,097,864270,468,0001,001,0002,449,408
9Oct 4, 2022 15:3655,777298,624,104272,306,0001,001,0002,441,216
10Oct 4, 2022 15:3655,890297,254,456272,862,000999,0002,281,472
11Oct 4, 2022 15:3655,907297,286,063271,946,0001,999,0002,449,408
12Oct 4, 2022 15:3655,913297,351,665271,975,0001,999,0002,445,312