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 9, 2021 12:38Yuriy LyfenkoYuriy LyfenkoScore: 103,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2021 12:38103,6611,034,085,133505,940,0001,999,0002,342,912
2Jul 9, 2021 12:38103,6681,033,505,825506,972,000999,0002,478,080
3Jul 9, 2021 12:38103,6951,028,007,191507,106,0001,000,0002,482,176
4Jul 9, 2021 12:38103,7111,032,545,383508,186,00002,478,080
5Jul 9, 2021 12:38103,7791,037,538,569507,519,000999,0002,482,176
6Jul 9, 2021 12:38103,7831,039,769,099507,536,000999,0002,478,080
7Jul 9, 2021 12:38103,7871,035,061,039506,558,0001,998,0002,478,080
8Jul 9, 2021 12:38103,8141,042,043,564507,690,000999,0002,478,080
9Jul 9, 2021 12:38103,8981,035,807,721508,099,0001,000,0002,478,080
10Jul 9, 2021 12:38104,2381,065,967,478510,767,74802,215,936
11Jul 9, 2021 12:38104,2521,060,070,790510,833,34202,195,456
12Jul 9, 2021 12:38104,2541,076,256,677510,846,84602,199,552