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 11:19Andrey TsvetkovAndrey TsvetkovScore: 664,184Success
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 11:18663,9373,317,959,3073,253,290,10102,207,744
2Jun 14, 2021 11:19664,0913,331,779,3853,254,043,92302,195,456
3Jun 14, 2021 11:18664,1313,306,756,1973,254,241,85202,199,552
4Jun 14, 2021 11:18664,1843,324,994,9883,254,499,32002,199,552
5Jun 14, 2021 11:19664,1903,318,427,1063,254,531,62902,211,840
6Jun 14, 2021 11:19664,5273,331,317,2313,256,180,45502,203,648