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 5, 2021 22:23Dmitry KashtanovDmitry KashtanovScore: 2,690,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 22:232,581,88912,716,919,99212,651,254,87202,240,512
2May 5, 2021 22:232,582,72712,717,504,96412,655,359,94302,240,512
3May 5, 2021 22:232,591,69512,765,149,90812,699,305,22302,252,800
4May 5, 2021 22:232,690,30413,249,500,86013,182,488,09602,248,704
5May 5, 2021 22:232,704,87513,323,060,73013,253,889,66202,248,704
6May 5, 2021 22:232,857,63014,075,815,68114,002,386,62802,244,608