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 00:39Robert BurkeRobert BurkeScore: 69,954Success
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 00:3968,033387,631,311333,363,17302,289,664
2Jul 22, 2022 00:3968,038391,730,793333,386,94902,285,568
3Jul 22, 2022 00:3968,057392,699,973333,481,38002,289,664
4Jul 22, 2022 00:3969,937362,824,818340,693,0001,998,0002,281,472
5Jul 22, 2022 00:3969,941365,908,029341,710,000999,0002,433,024
6Jul 22, 2022 00:3969,954364,936,043341,774,000999,0002,281,472
7Jul 22, 2022 00:3969,954369,566,340340,777,0001,998,0002,433,024
8Jul 22, 2022 00:3969,960367,630,974341,807,000999,0002,281,472
9Jul 22, 2022 00:3969,962365,655,566341,817,000999,0002,281,472
10Jul 22, 2022 00:3969,966366,201,217341,832,000999,0002,281,472
11Jul 22, 2022 00:3969,972365,168,585340,865,0001,999,0002,428,928
12Jul 22, 2022 00:3969,984371,203,105341,925,000999,0002,428,928