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:40Robert BurkeRobert BurkeScore: 70,076Success
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:4067,831398,634,794332,372,44302,289,664
2Jul 22, 2022 00:4067,866399,249,020332,542,92402,285,568
3Jul 22, 2022 00:4067,934396,560,203332,876,42102,289,664
4Jul 22, 2022 00:4070,034367,267,322343,166,00002,281,472
5Jul 22, 2022 00:4070,049367,358,545343,242,00002,433,024
6Jul 22, 2022 00:4070,076372,156,461343,370,00002,281,472
7Jul 22, 2022 00:4070,076371,311,429342,372,0001,001,0002,281,472
8Jul 22, 2022 00:4070,078369,489,453342,382,0001,001,0002,281,472
9Jul 22, 2022 00:4070,098370,882,572342,480,000998,0002,281,472
10Jul 22, 2022 00:4070,131367,048,920342,643,000998,0002,281,472
11Jul 22, 2022 00:4070,144368,296,426342,708,000999,0002,428,928
12Jul 22, 2022 00:4070,152369,391,882341,748,0001,998,0002,281,472