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 14, 2021 18:00Andrey TsvetkovAndrey TsvetkovScore: 613,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2021 18:00613,8693,078,635,1653,007,958,21002,207,744
2Jun 14, 2021 12:50613,8863,063,339,2783,008,043,84702,203,648
3Jun 14, 2021 12:50613,8983,084,130,4813,008,100,86502,211,840
4Jun 14, 2021 18:00613,9603,073,250,0193,008,406,06102,203,648
5Jun 14, 2021 18:00613,9763,078,119,5803,008,482,13602,207,744
6Jun 14, 2021 12:50614,0583,071,246,2153,008,882,43402,211,840