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 07:39Yuriy LyfenkoYuriy LyfenkoScore: 100,224Success
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 07:3999,747551,298,567488,759,27602,203,648
2Dec 9, 2021 07:39100,126516,868,884488,618,0001,998,0002,527,232
3Dec 9, 2021 07:39100,139514,452,943488,685,0001,998,0002,347,008
4Dec 9, 2021 07:39100,152518,782,743488,748,0001,998,0002,265,088
5Dec 9, 2021 07:39100,159515,767,481488,780,0001,999,0002,461,696
6Dec 9, 2021 07:39100,174518,534,452489,852,000999,0002,265,088
7Dec 9, 2021 07:39100,224513,148,000490,097,0001,000,0002,527,232
8Dec 9, 2021 07:39100,251521,392,097491,230,00002,265,088
9Dec 9, 2021 07:39100,252513,596,483491,237,00002,527,232
10Dec 9, 2021 07:39100,261517,326,832489,283,0001,997,0002,334,720
11Dec 9, 2021 07:39100,271568,335,267491,325,53102,203,648
12Dec 9, 2021 07:39100,375547,755,094491,838,02802,207,744