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 20:58Dmitry DolgopolovDmitry DolgopolovScore: 482,656Success
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 20:58446,7082,251,072,9092,188,868,01002,248,704
2May 3, 2021 20:58446,7312,250,180,6032,188,983,05102,244,608
3May 3, 2021 20:58446,8782,251,118,3882,189,703,12802,256,896
4May 3, 2021 20:58482,6562,416,913,7702,365,015,05102,252,800
5May 3, 2021 20:58482,6652,429,283,9552,365,060,92902,248,704
6May 3, 2021 20:58482,7092,422,825,3852,365,274,87402,256,896