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:04Andrey TsvetkovAndrey TsvetkovScore: 616,226Success
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:04615,8993,075,606,1873,017,903,13902,207,744
2Jun 14, 2021 18:04616,1143,095,991,4153,018,958,85602,195,456
3Jun 14, 2021 18:04616,1623,077,552,1213,019,191,81602,211,840
4Jun 14, 2021 18:04616,2263,091,394,9873,019,505,05502,203,648
5Jun 14, 2021 18:04616,5203,081,047,8083,020,946,05802,195,456
6Jun 14, 2021 18:04616,6463,080,085,7963,021,565,48602,199,552