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 listOct 3, 2022 04:23Bernard TeoBernard TeoScore: 60,597Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2022 04:2360,555320,370,329294,720,0001,998,0002,519,040
2Oct 3, 2022 04:2360,555318,739,678295,722,000999,0002,281,472
3Oct 3, 2022 04:2360,572317,500,161294,807,0001,998,0002,404,352
4Oct 3, 2022 04:2360,573319,892,698294,810,0001,998,0002,396,160
5Oct 3, 2022 04:2360,580320,183,149295,843,000999,0002,281,472
6Oct 3, 2022 04:2360,587366,106,183296,878,69402,265,088
7Oct 3, 2022 04:2360,597321,231,739295,928,000999,0002,404,352
8Oct 3, 2022 04:2360,621358,662,876297,042,58202,256,896
9Oct 3, 2022 04:2360,631323,259,817296,094,0001,000,0002,400,256
10Oct 3, 2022 04:2360,637319,579,787296,123,0001,000,0002,396,160
11Oct 3, 2022 04:2360,640320,687,868296,138,0001,000,0002,396,160
12Oct 3, 2022 04:2361,637368,097,078302,022,44802,269,184