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 listSep 20, 2022 15:57Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2022 15:5700000Error: expected "560381805965 ", got "1626 0 7751 0 4171 0 2020 0 2773 0 6611 0 5641 0 2140 0 6955 0 2279 0 457 0 479 0 8783 0 1457 0 4188 0 1164 0 38 0 40 0 8 0 14 0 7 0 24 0 32 0 6 0 17903 40244 19290 7092 19325 32812 12153 25921 21699 26693 31236...