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 2, 2021 15:32Yuriy LyfenkoYuriy LyfenkoScore: 107,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2021 15:32107,5181,055,063,352526,836,00002,428,928
2Jul 2, 2021 15:32107,5251,057,599,118526,874,00002,433,024
3Jul 2, 2021 15:32107,6101,054,082,233526,287,0001,000,0002,428,928
4Jul 2, 2021 15:32107,6631,053,408,996527,548,00002,437,120
5Jul 2, 2021 15:32107,6841,053,551,648526,651,000999,0002,433,024
6Jul 2, 2021 15:32107,7151,049,260,095526,804,000999,0002,523,136
7Jul 2, 2021 15:32107,7711,050,736,615528,079,00002,428,928
8Jul 2, 2021 15:32107,9791,054,943,410528,099,0001,000,0002,433,024
9Jul 2, 2021 15:32108,2811,061,984,094528,577,0001,998,0002,260,992
10Jul 2, 2021 15:32126,5561,204,113,365620,125,53002,273,280
11Jul 2, 2021 15:32126,7351,171,255,708620,999,67502,293,760
12Jul 2, 2021 15:32126,8091,171,786,965621,365,81702,277,376