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 11:49Robert BurkeRobert BurkeScore: 61,637Success
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 11:4958,992351,312,792289,063,22102,179,072
2Oct 4, 2022 11:4959,004356,740,980289,121,00902,187,264
3Oct 4, 2022 11:4959,026353,680,060289,229,27002,187,264
4Oct 4, 2022 11:4961,589324,254,043299,789,0001,998,0002,437,120
5Oct 4, 2022 11:4961,610323,127,371299,888,0001,999,0002,281,472
6Oct 4, 2022 11:4961,623324,634,866299,952,0001,999,0002,445,312
7Oct 4, 2022 11:4961,637324,363,124300,022,0002,000,0002,281,472
8Oct 4, 2022 11:4961,638328,705,860300,025,0002,000,0002,281,472
9Oct 4, 2022 11:4961,641329,010,672301,042,0001,000,0002,281,472
10Oct 4, 2022 11:4961,648329,161,851300,073,0002,000,0002,281,472
11Oct 4, 2022 11:4961,665329,773,263301,160,0001,000,0002,453,504
12Oct 4, 2022 11:4962,030329,031,130301,949,0001,999,0002,437,120