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 11, 2021 16:03Dmitry DolgopolovDmitry DolgopolovScore: 181,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 15:59179,222933,350,532878,189,65102,183,168
2Jun 11, 2021 15:59180,503951,152,414884,462,32802,179,072
3Jun 11, 2021 16:03180,783944,158,893885,837,36302,174,976
4Jun 11, 2021 16:03181,153947,667,896887,648,45302,170,880
5Jun 11, 2021 16:03183,808970,500,978900,659,90702,174,976
6Jun 11, 2021 15:59185,032985,379,263906,659,02602,183,168