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 22, 2022 01:28Robert BurkeRobert BurkeScore: 70,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2022 01:2867,697391,497,665331,716,87602,285,568
2Jul 22, 2022 01:2867,712397,994,399331,787,25102,285,568
3Jul 22, 2022 01:2870,238367,644,021344,166,00002,281,472
4Jul 22, 2022 01:2870,269368,097,740344,318,00002,424,832
5Jul 22, 2022 01:2870,276366,187,705344,351,00002,433,024
6Jul 22, 2022 01:2870,333372,165,293344,630,00002,428,928
7Jul 22, 2022 01:2870,334374,156,878343,641,000998,0002,424,832
8Jul 22, 2022 01:2870,357369,151,146343,749,000999,0002,428,928
9Jul 22, 2022 01:2870,443366,900,308345,169,00002,281,472
10Jul 22, 2022 01:2870,509377,104,526345,493,00002,424,832
11Jul 22, 2022 01:2874,739414,758,526366,221,18902,293,760
12Jul 22, 2022 01:2878,486413,838,663383,583,000998,0002,428,928