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:34Yuriy LyfenkoYuriy LyfenkoScore: 100,196Success
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:3499,641546,084,554488,239,46302,203,648
2Dec 9, 2021 17:3499,752545,897,928488,784,52202,203,648
3Dec 9, 2021 17:3499,805554,851,211489,045,50802,203,648
4Dec 9, 2021 17:34100,154517,081,360489,757,000999,0002,461,696
5Dec 9, 2021 17:34100,170516,514,697489,835,000999,0002,265,088
6Dec 9, 2021 17:34100,176515,181,670489,861,000999,0002,347,008
7Dec 9, 2021 17:34100,196515,979,823489,962,000999,0002,342,912
8Dec 9, 2021 17:34100,202519,226,907488,989,0001,999,0002,527,232
9Dec 9, 2021 17:34100,222515,170,443490,087,0001,000,0002,527,232
10Dec 9, 2021 17:34100,228514,777,779490,118,0001,000,0002,338,816
11Dec 9, 2021 17:34100,278514,365,652490,360,0001,000,0002,265,088
12Dec 9, 2021 17:34100,281523,897,327490,378,000998,0002,265,088