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 listJul 22, 2022 18:30Robert BurkeRobert BurkeScore: 64,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2022 18:3063,457367,341,674310,937,83802,285,568
2Jul 22, 2022 18:3063,458373,939,036310,943,55002,170,880
3Jul 22, 2022 18:3063,515373,156,419311,223,67202,285,568
4Jul 22, 2022 18:3064,624341,213,457315,659,000998,0002,424,832
5Jul 22, 2022 18:3064,624340,316,513315,660,000998,0002,424,832
6Jul 22, 2022 18:3064,636340,151,926314,716,0001,998,0002,281,472
7Jul 22, 2022 18:3064,676337,771,368315,915,000999,0002,433,024
8Jul 22, 2022 18:3064,683344,881,545315,950,000999,0002,281,472
9Jul 22, 2022 18:3064,685336,042,033315,959,000999,0002,424,832
10Jul 22, 2022 18:3064,697341,543,142316,016,0001,000,0002,433,024
11Jul 22, 2022 18:3064,788346,615,683315,463,0001,996,0002,433,024
12Jul 22, 2022 18:3064,789344,102,573316,466,0001,001,0002,281,472