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: 676,930Success
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:48642,5913,204,776,2153,148,697,81402,273,280
2May 17, 2021 23:48642,6573,211,615,3793,149,018,42402,277,376
3May 17, 2021 23:48642,6703,204,771,6583,149,083,81102,265,088
4May 17, 2021 23:48676,9303,382,053,1243,316,956,53002,277,376
5May 17, 2021 23:48676,9493,368,063,0293,317,050,81102,269,184
6May 17, 2021 23:48677,0033,388,181,8523,317,315,59202,273,280