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 3, 2021 21:22Dmitry DolgopolovDmitry DolgopolovScore: 521,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2021 21:22469,4572,371,805,0892,300,340,47602,252,800
2May 3, 2021 21:22469,5262,360,583,3062,300,679,18602,252,800
3May 3, 2021 21:22469,5432,359,970,4212,300,761,70702,260,992
4May 3, 2021 21:22521,3602,613,176,6392,554,662,62502,240,512
5May 3, 2021 21:22521,3602,615,527,4372,554,664,92002,248,704
6May 3, 2021 21:22521,4252,622,282,9092,554,982,24702,256,896