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 21, 2021 09:52Sergey StreminSergey StreminScore: 271,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2021 09:52204,5121,070,506,1281,002,110,88502,207,744
2May 21, 2021 09:52204,5531,058,837,9501,002,309,99902,199,552
3May 21, 2021 09:52204,7131,067,760,3881,003,095,03902,203,648
4May 21, 2021 09:52271,5441,396,329,1431,330,564,93102,191,360
5May 21, 2021 09:52271,5551,398,176,5431,330,618,81802,195,456
6May 21, 2021 09:52271,6311,396,874,0241,330,992,47002,199,552