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 21, 2021 19:14Dmitry DolgopolovDmitry DolgopolovScore: 504,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2021 19:14452,4172,280,761,7552,216,841,33402,240,512
2May 21, 2021 19:14452,4212,284,013,1282,216,864,12202,248,704
3May 21, 2021 19:14452,4642,272,145,8212,217,073,17502,248,704
4May 21, 2021 19:14504,9002,528,891,4202,474,008,64302,252,800
5May 21, 2021 19:14504,9032,530,784,4922,474,024,82502,244,608
6May 21, 2021 19:14504,9332,525,083,6862,474,173,57302,252,800