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 4, 2021 18:13Ivan PodogovIvan PodogovScore: 2,476,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2021 18:132,381,59611,723,921,75111,669,822,45102,260,992
2May 4, 2021 18:132,385,84511,744,982,16511,690,640,10302,252,800
3May 4, 2021 18:132,388,53911,776,979,31211,703,839,64402,248,704
4May 4, 2021 18:132,476,46812,202,566,21112,134,691,48102,248,704
5May 4, 2021 18:132,478,34612,206,764,86712,143,897,71502,256,896
6May 4, 2021 18:132,482,28912,222,158,51412,163,217,19902,252,800