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:48Yurkov AlekseyYurkov AlekseyScore: 689,371Success
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:48659,5073,287,517,9413,231,583,82802,277,376
2May 17, 2021 23:48659,5463,293,840,0633,231,774,16502,265,088
3May 17, 2021 23:48659,5813,294,832,4373,231,947,38002,273,280
4May 17, 2021 23:48689,3713,454,689,2743,377,916,45502,281,472
5May 17, 2021 23:48689,3993,438,600,3813,378,056,34302,260,992
6May 17, 2021 23:48689,4203,449,055,6133,378,159,24702,273,280