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:23Yuriy LyfenkoYuriy LyfenkoScore: 108,757Success
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:23108,5681,063,034,185530,983,000999,0002,482,176
2Jul 9, 2021 12:23108,5731,061,720,873532,006,00002,478,080
3Jul 9, 2021 12:23108,6731,057,767,988530,500,0001,998,0002,482,176
4Jul 9, 2021 12:23108,6731,060,949,834531,501,000999,0002,482,176
5Jul 9, 2021 12:23108,6771,061,853,273530,520,0001,998,0002,482,176
6Jul 9, 2021 12:23108,6811,057,703,855530,537,0001,998,0002,478,080
7Jul 9, 2021 12:23108,7571,059,019,642530,908,0001,999,0002,347,008
8Jul 9, 2021 12:23108,7841,057,689,450533,041,00002,523,136
9Jul 9, 2021 12:23108,8111,062,253,725532,178,000998,0002,482,176
10Jul 9, 2021 12:23120,5051,146,999,929590,476,94702,191,360
11Jul 9, 2021 12:23120,6081,157,541,949590,977,71702,195,456
12Jul 9, 2021 12:23120,7931,160,696,168591,883,38002,191,360