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:03Andrey TsvetkovAndrey TsvetkovScore: 625,632Success
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:03624,7343,122,213,0913,061,194,88402,191,360
2Jun 14, 2021 18:02625,0553,131,942,4003,062,770,46502,207,744
3Jun 14, 2021 18:02625,3223,125,082,8543,064,077,43402,191,360
4Jun 14, 2021 18:02625,6323,124,526,1993,065,597,14502,203,648
5Jun 14, 2021 18:03625,8323,133,171,4213,066,578,77202,195,456
6Jun 14, 2021 18:03625,8333,119,877,3193,066,579,91102,199,552