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:53Yuriy LyfenkoYuriy LyfenkoScore: 100,253Success
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:5399,676545,726,180488,412,22402,207,744
2Dec 9, 2021 07:5399,787551,524,879488,955,62702,211,840
3Dec 9, 2021 07:53100,110517,265,670488,543,0001,998,0002,347,008
4Dec 9, 2021 07:53100,133517,266,287488,652,0001,998,0002,338,816
5Dec 9, 2021 07:53100,224510,355,428491,100,00002,461,696
6Dec 9, 2021 07:53100,240511,110,577490,178,0001,000,0002,269,184
7Dec 9, 2021 07:53100,253517,398,104491,242,00002,342,912
8Dec 9, 2021 07:53100,265516,019,194491,300,00002,338,816
9Dec 9, 2021 07:53100,267525,201,304491,309,00002,527,232
10Dec 9, 2021 07:53100,272518,311,806489,336,0001,997,0002,342,912
11Dec 9, 2021 07:53100,322572,987,878491,578,62002,203,648
12Dec 9, 2021 07:53100,390520,269,748489,911,0001,999,0002,347,008