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 listJul 30, 2022 05:08evgenikwtevgenikwtScore: 173,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2022 04:25172,355916,417,860844,538,00602,236,416
2Jul 26, 2022 13:08172,731903,336,960846,381,20402,199,552
3Jul 26, 2022 13:08172,957916,968,858847,489,67602,203,648
4Jul 30, 2022 04:25173,037921,175,009847,880,31802,220,032
5Jul 30, 2022 04:25173,223913,665,987848,794,99702,199,552
6Jul 30, 2022 05:08173,237923,604,634848,862,00902,211,840
7Jul 26, 2022 13:08173,290914,087,564849,121,51402,203,648
8Jul 30, 2022 05:08173,787914,191,035851,554,40902,195,456
9Jul 30, 2022 05:08174,469931,312,575854,895,84302,203,648