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 10:14recarrecarScore: 6,294,480Success
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 10:146,164,53930,270,552,43730,206,241,19302,252,800
2May 3, 2021 10:146,164,77030,267,368,24730,207,373,31502,244,608
3May 3, 2021 10:146,292,89530,907,683,74230,835,183,70402,252,800
4May 3, 2021 10:146,294,48030,906,995,47330,842,950,32102,252,800
5May 3, 2021 10:146,463,48031,725,723,36631,671,054,42302,256,896
6May 3, 2021 10:146,595,30732,384,145,30032,317,003,25002,248,704