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:01Robert BurkeRobert BurkeScore: 60,375Success
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:0159,941320,075,210291,715,0001,998,0002,437,120
2Oct 4, 2022 15:0160,192318,935,304292,942,0001,999,0002,445,312
3Oct 4, 2022 15:0160,218317,510,398293,066,0002,000,0002,281,472
4Oct 4, 2022 15:0160,302318,670,685294,479,0001,001,0002,445,312
5Oct 4, 2022 15:0160,338318,270,623294,658,000998,0002,281,472
6Oct 4, 2022 15:0160,362322,167,747293,775,0001,998,0002,445,312
7Oct 4, 2022 15:0160,375320,163,388293,840,0001,998,0002,441,216
8Oct 4, 2022 15:0161,558326,850,572300,634,000998,0002,281,472
9Oct 4, 2022 15:0162,402360,075,406305,767,81402,183,168
10Oct 4, 2022 15:0162,416363,995,472305,837,56502,183,168
11Oct 4, 2022 15:0168,515362,680,686333,725,0001,998,0002,281,472
12Oct 4, 2022 15:0175,616422,498,811370,519,99802,179,072