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 25, 2021 18:47Yurkov AlekseyYurkov AlekseyScore: 664,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2021 18:46664,5283,336,851,8503,256,185,64102,265,088
2May 25, 2021 18:46664,6123,301,446,8383,256,598,01402,269,184
3May 25, 2021 18:47664,6143,307,203,7973,256,607,04402,277,376
4May 25, 2021 18:46664,6193,298,228,8303,256,635,17902,265,088
5May 25, 2021 18:47664,6253,301,358,3283,256,663,56602,269,184
6May 25, 2021 18:47664,7123,319,223,2253,257,087,06502,273,280