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 listOct 24, 2021 20:22evgenikwtevgenikwtScore: 185,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2021 20:18185,449967,844,174908,699,01402,215,936
2Oct 24, 2021 20:18185,456964,804,379908,736,63402,224,128
3Oct 24, 2021 20:22185,475971,931,877908,829,05302,220,032
4Oct 24, 2021 20:22185,497963,579,251908,933,63802,220,032
5Oct 24, 2021 20:22185,498969,132,861908,942,55002,220,032
6Oct 24, 2021 20:18185,506963,068,456908,980,31802,224,128