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 18:13Yuriy LyfenkoYuriy LyfenkoScore: 100,217Success
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 18:1399,902550,255,039489,518,61002,203,648
2Dec 9, 2021 18:1399,907542,029,356489,542,20902,207,744
3Dec 9, 2021 18:1399,925555,909,156489,634,68002,199,552
4Dec 9, 2021 18:13100,178523,767,074489,873,000999,0002,465,792
5Dec 9, 2021 18:13100,189519,461,955489,929,000999,0002,465,792
6Dec 9, 2021 18:13100,200516,537,688489,983,000999,0002,338,816
7Dec 9, 2021 18:13100,217520,002,762490,063,0001,000,0002,265,088
8Dec 9, 2021 18:13100,226516,365,953490,109,0001,000,0002,265,088
9Dec 9, 2021 18:13100,252516,501,761490,235,0001,000,0002,265,088
10Dec 9, 2021 18:13100,274521,674,656489,342,0002,001,0002,265,088
11Dec 9, 2021 18:13100,276517,674,648489,354,0001,997,0002,523,136
12Dec 9, 2021 18:13100,302516,301,405490,480,000998,0002,342,912