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 10, 2021 21:31Sergey StreminSergey StreminScore: 503,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2021 21:31435,8862,196,348,1762,135,839,18702,203,648
2May 10, 2021 21:31436,4582,202,873,7942,138,645,18902,199,552
3May 10, 2021 21:31436,5882,202,821,4632,139,283,52502,195,456
4May 10, 2021 21:31503,8502,530,595,7772,468,865,69302,191,360
5May 10, 2021 21:31504,1152,524,096,3472,470,162,68402,211,840
6May 10, 2021 21:31504,1772,518,914,3712,470,466,66602,207,744