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 17, 2021 23:55Yurkov AlekseyYurkov AlekseyScore: 671,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 23:55637,9623,205,208,6353,126,014,22502,265,088
2May 17, 2021 23:55638,2333,194,991,7633,127,342,66602,277,376
3May 17, 2021 23:55638,7503,193,614,3393,129,873,42902,281,472
4May 17, 2021 23:55671,6223,361,234,6323,290,946,96802,285,568
5May 17, 2021 23:55671,7423,350,708,9253,291,537,26002,265,088
6May 17, 2021 23:55672,0603,353,776,5933,293,094,56102,265,088