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:33Yuriy LyfenkoYuriy LyfenkoScore: 100,173Success
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:3399,784549,086,615488,941,75702,195,456
2Dec 9, 2021 17:3399,877543,516,664489,397,21802,215,936
3Dec 9, 2021 17:33100,135517,200,918488,663,0001,998,0002,338,816
4Dec 9, 2021 17:33100,138515,139,224489,675,0001,001,0002,527,232
5Dec 9, 2021 17:33100,163528,560,969488,801,0001,999,0002,265,088
6Dec 9, 2021 17:33100,168517,233,920488,822,0001,999,0002,527,232
7Dec 9, 2021 17:33100,173520,326,408488,849,0001,999,0002,265,088
8Dec 9, 2021 17:33100,193573,408,397490,944,92102,203,648
9Dec 9, 2021 17:33100,200513,423,300489,981,000999,0002,265,088
10Dec 9, 2021 17:33100,239514,865,019490,172,0001,000,0002,265,088
11Dec 9, 2021 17:33100,271513,295,290490,330,0001,000,0002,265,088
12Dec 9, 2021 17:33100,278523,363,229489,363,0001,997,0002,265,088