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 listMay 3, 2021 22:31Stanislav-PovolotskyStanislav-PovolotskyScore: 429,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2021 22:31378,4981,919,511,3301,854,641,27702,265,088
2May 3, 2021 22:31378,6291,916,824,3241,855,283,01502,273,280
3May 3, 2021 22:31378,8511,918,683,4491,856,372,19502,265,088
4May 3, 2021 22:31429,0042,156,247,9632,102,118,87302,273,280
5May 3, 2021 22:31429,0902,155,726,1562,102,540,08302,269,184
6May 3, 2021 22:31429,1012,157,878,1792,102,596,98002,269,184