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,839Success
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,9223,137,347,4083,067,018,64802,260,992
2May 17, 2021 23:51625,9793,144,930,9113,067,296,78402,273,280
3May 17, 2021 23:51626,0003,124,733,4453,067,401,52402,269,184
4May 17, 2021 23:51647,8393,236,912,5433,174,412,64002,269,184
5May 17, 2021 23:51647,9033,251,852,7113,174,725,76002,277,376
6May 17, 2021 23:51647,9813,247,138,6103,175,104,81202,273,280