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 21, 2021 19:20Dmitry DolgopolovDmitry DolgopolovScore: 483,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2021 19:20448,4092,253,230,6832,197,202,77002,301,952
2May 21, 2021 19:20448,4092,256,551,9812,197,203,14502,179,072
3May 21, 2021 19:20448,4422,249,861,0352,197,363,81402,183,168
4May 21, 2021 19:20483,8022,443,821,6902,370,629,35302,174,976
5May 21, 2021 19:20483,8122,428,954,2702,370,678,59302,301,952
6May 21, 2021 19:20483,8392,426,857,6062,370,812,83002,174,976