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 listDec 20, 2023 12:23matsuoka-601matsuoka-601Score: 177,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2023 12:07177,001943,249,123867,306,53102,293,760
2Dec 20, 2023 12:23177,076931,503,162867,674,43302,297,856
3Dec 20, 2023 12:23177,366935,253,063869,093,76502,174,976
4Dec 20, 2023 12:23177,791935,780,632871,177,41002,301,952
5Dec 20, 2023 12:07177,977944,166,282872,089,62502,301,952
6Dec 20, 2023 12:23178,015934,777,251872,272,26802,301,952
7Dec 20, 2023 12:07178,135942,686,477872,862,68802,297,856
8Dec 20, 2023 12:23178,345932,972,398873,892,71002,297,856
9Dec 20, 2023 12:23179,120932,288,906877,687,48402,293,760