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:58Yuriy LyfenkoYuriy LyfenkoScore: 204,748Success
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:56200,0251,041,659,611980,122,51302,179,072
2Jul 9, 2021 12:56203,6141,053,350,323997,707,51802,191,360
3Jul 9, 2021 12:59204,1261,068,401,7571,000,218,34102,191,360
4Jul 9, 2021 12:56204,2601,055,359,1191,000,875,31902,191,360
5Jul 9, 2021 12:58204,7481,064,971,0931,003,265,79902,187,264
6Jul 9, 2021 12:59205,5241,083,331,2501,007,067,26502,183,168
7Jul 9, 2021 12:58205,9031,073,323,6961,008,923,94002,187,264
8Jul 9, 2021 12:59211,6111,089,094,3481,036,891,46902,187,264
9Jul 9, 2021 12:58224,3751,154,647,7141,099,436,40402,187,264