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 8, 2021 11:29Dmitry DolgopolovDmitry DolgopolovScore: 180,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2021 11:28180,168953,269,352882,822,96802,179,072
2Jun 8, 2021 11:28180,324948,639,999883,585,38802,179,072
3Jun 8, 2021 11:29180,355946,900,017883,740,86502,174,976
4Jun 8, 2021 11:29180,686944,381,337885,362,46802,179,072
5Jun 8, 2021 11:28184,660962,160,011904,831,92502,174,976
6Jun 8, 2021 11:29184,701966,073,754905,033,11902,179,072