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 24, 2021 07:48alex3dalex3dScore: 667,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2021 07:48574,6022,880,347,0642,815,551,99002,273,280
2May 24, 2021 07:48574,7042,894,080,3322,816,049,68202,265,088
3May 24, 2021 07:48574,7102,881,439,7962,816,079,38702,265,088
4May 24, 2021 07:48667,2593,333,815,9303,269,567,79902,273,280
5May 24, 2021 07:48667,5163,342,117,0313,270,826,36802,273,280
6May 24, 2021 07:48667,8383,349,922,6803,272,406,01202,273,280