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 listDec 9, 2021 17:46Yuriy LyfenkoYuriy LyfenkoScore: 100,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2021 17:4699,753547,653,980488,788,75902,207,744
2Dec 9, 2021 17:4699,793553,889,727488,985,48202,207,744
3Dec 9, 2021 17:4699,864549,510,095489,331,85102,211,840
4Dec 9, 2021 17:46100,157516,871,904488,768,0001,999,0002,461,696
5Dec 9, 2021 17:46100,181515,320,324489,887,000999,0002,265,088
6Dec 9, 2021 17:46100,201517,100,650488,988,0001,999,0002,334,720
7Dec 9, 2021 17:46100,228515,704,525489,116,0002,000,0002,334,720
8Dec 9, 2021 17:46100,230517,522,382489,126,0002,000,0002,338,816
9Dec 9, 2021 17:46100,233517,459,404490,140,0001,000,0002,527,232
10Dec 9, 2021 17:46100,234512,506,754490,149,0001,000,0002,265,088
11Dec 9, 2021 17:46100,257514,295,850491,259,00002,334,720
12Dec 9, 2021 17:46100,262520,086,435490,285,0001,000,0002,334,720