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,883Success
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,9953,124,960,8053,067,376,36102,265,088
2May 17, 2021 23:51626,0693,139,405,1453,067,739,52302,277,376
3May 17, 2021 23:51626,1173,138,008,6843,067,972,29202,269,184
4May 17, 2021 23:51647,8833,233,864,3183,174,628,46502,273,280
5May 17, 2021 23:51647,8933,236,068,6323,174,674,44302,269,184
6May 17, 2021 23:51647,9683,262,021,8413,175,045,40102,273,280