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:50Yurkov AlekseyYurkov AlekseyScore: 689,339Success
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:50659,4923,296,241,1113,231,508,44102,273,280
2May 17, 2021 23:50659,5593,291,311,3153,231,839,26702,260,992
3May 17, 2021 23:50659,5643,297,870,6003,231,864,57002,269,184
4May 17, 2021 23:50689,3393,433,459,0063,377,760,08302,273,280
5May 17, 2021 23:50689,3643,440,645,8493,377,883,98202,265,088
6May 17, 2021 23:50689,4143,439,082,2453,378,126,71402,273,280