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 28, 2021 17:34Yuriy LyfenkoYuriy LyfenkoScore: 102,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 28, 2021 17:34101,898528,463,262498,298,0001,000,0002,527,232
2Oct 28, 2021 17:34101,972526,137,107498,662,000999,0002,265,088
3Oct 28, 2021 17:34101,972527,750,636498,663,000999,0002,265,088
4Oct 28, 2021 17:34101,974527,727,941497,675,0001,998,0002,478,080
5Oct 28, 2021 17:34101,998526,384,703497,791,0001,999,0002,338,816
6Oct 28, 2021 17:34102,010529,799,246497,849,0001,999,0002,527,232
7Oct 28, 2021 17:34102,024523,707,016497,921,0001,999,0002,334,720
8Oct 28, 2021 17:34102,033528,093,333497,963,0001,999,0002,347,008
9Oct 28, 2021 17:34102,066522,679,200499,121,0001,000,0002,527,232
10Oct 28, 2021 17:34103,057571,348,012504,981,38602,207,744
11Oct 28, 2021 17:34103,091568,508,821505,145,69102,203,648
12Oct 28, 2021 17:34103,120557,451,744505,286,90202,207,744