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 17, 2021 23:51Yurkov AlekseyYurkov AlekseyScore: 647,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 23:51625,9243,146,584,2123,067,026,97402,277,376
2May 17, 2021 23:51625,9953,137,521,8973,067,377,01302,256,896
3May 17, 2021 23:51626,0373,132,993,5153,067,580,17902,265,088
4May 17, 2021 23:51647,8463,252,175,5783,174,443,04302,273,280
5May 17, 2021 23:51647,9163,242,283,6103,174,788,55002,277,376
6May 17, 2021 23:51647,9273,244,243,9683,174,844,47802,273,280