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:38Sergey StreminSergey StreminScore: 503,290Success
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:38432,8022,228,627,7172,120,729,75602,203,648
2May 10, 2021 21:38432,8542,177,928,2882,120,986,81002,195,456
3May 10, 2021 21:38432,9532,199,707,6002,121,468,21202,207,744
4May 10, 2021 21:38503,2902,522,778,6442,466,118,61502,195,456
5May 10, 2021 21:38503,4892,536,301,4882,467,095,75302,207,744
6May 10, 2021 21:38503,8192,535,697,4612,468,715,45102,211,840