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 listMay 17, 2021 23:48Yurkov AlekseyYurkov AlekseyScore: 689,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 23:48659,5193,295,532,2163,231,642,78702,269,184
2May 17, 2021 23:48659,5483,305,473,3513,231,784,31002,273,280
3May 17, 2021 23:48659,5853,298,557,6823,231,968,02902,269,184
4May 17, 2021 23:48689,3733,445,967,2833,377,929,00902,277,376
5May 17, 2021 23:48689,3953,433,832,6793,378,037,83402,281,472
6May 17, 2021 23:48689,4453,448,219,1173,378,281,65702,273,280