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 20, 2022 00:39Robert BurkeRobert BurkeScore: 186,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2022 00:39185,142980,898,364907,197,28502,285,568
2Jul 20, 2022 00:39185,272984,489,284907,833,28302,285,568
3Jul 20, 2022 00:39185,701962,989,313909,933,75102,285,568
4Jul 20, 2022 00:39186,383974,391,852913,276,83702,289,664
5Jul 20, 2022 00:39186,645973,616,295914,560,45502,277,376
6Jul 20, 2022 00:39187,309974,900,566917,812,53002,289,664