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 20, 2021 06:55Sergey StreminSergey StreminScore: 331,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2021 06:55260,1571,352,098,0001,274,770,33202,215,936
2May 20, 2021 06:55260,1901,342,111,2321,274,929,11502,207,744
3May 20, 2021 06:55260,2121,347,138,6701,275,040,70602,215,936
4May 20, 2021 06:55331,7681,693,333,9291,625,661,85102,207,744
5May 20, 2021 06:55331,9301,674,822,2351,626,457,30702,203,648
6May 20, 2021 06:55332,0391,696,573,7101,626,992,48902,211,840