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 3, 2021 22:23Stanislav-PovolotskyStanislav-PovolotskyScore: 429,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2021 22:23380,0651,923,386,5861,862,318,34302,265,088
2May 3, 2021 22:23380,1211,929,118,6621,862,592,85902,265,088
3May 3, 2021 22:23380,6701,929,680,3401,865,280,94102,273,280
4May 3, 2021 22:23429,8302,159,101,3012,106,166,36102,285,568
5May 3, 2021 22:23430,0222,168,806,1352,107,105,47202,277,376
6May 3, 2021 22:23430,0382,163,598,9632,107,187,87002,269,184