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 listJun 7, 2021 13:55Dmitry DolgopolovDmitry DolgopolovScore: 197,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2021 13:54196,5721,019,920,062963,204,90202,301,952
2Jun 7, 2021 13:55196,6771,025,965,749963,718,79502,174,976
3Jun 7, 2021 13:54197,2871,032,713,709966,708,61202,174,976
4Jun 7, 2021 13:55197,3861,029,068,034967,193,40802,179,072
5Jun 7, 2021 13:55199,5411,036,714,187977,751,93202,170,880
6Jun 7, 2021 13:54199,9831,048,913,487979,914,40602,174,976