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 20, 2021 00:35Yurkov AlekseyYurkov AlekseyScore: 660,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2021 00:35627,4503,160,665,9293,074,504,25602,260,992
2May 20, 2021 00:35627,5843,145,897,3103,075,160,64902,269,184
3May 20, 2021 00:35627,5863,151,170,0103,075,172,93202,260,992
4May 20, 2021 00:35660,5713,317,043,6783,236,798,46402,260,992
5May 20, 2021 00:35660,6823,305,470,4023,237,342,40102,260,992
6May 20, 2021 00:35660,7443,316,936,6823,237,644,41802,265,088
7May 20, 2021 00:35660,8913,321,117,6413,238,367,29302,265,088
8May 20, 2021 00:35660,9313,306,996,7803,238,560,25502,256,896
9May 20, 2021 00:35660,9573,309,078,3983,238,689,57302,265,088