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 21, 2022 19:05Robert BurkeRobert BurkeScore: 74,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2022 19:0570,492398,440,346345,412,64102,289,664
2Jul 21, 2022 19:0570,559400,162,007345,737,55102,289,664
3Jul 21, 2022 19:0571,186405,516,541348,812,08702,285,568
4Jul 21, 2022 19:0574,485388,834,828363,979,000999,0002,281,472
5Jul 21, 2022 19:0574,496386,524,830364,031,0001,000,0002,433,024
6Jul 21, 2022 19:0574,498389,982,960365,039,00002,428,928
7Jul 21, 2022 19:0574,545387,787,192365,270,00002,281,472
8Jul 21, 2022 19:0574,549389,746,473365,291,00002,281,472
9Jul 21, 2022 19:0574,553390,348,390365,309,00002,428,928
10Jul 21, 2022 19:0574,557388,046,414365,328,00002,281,472
11Jul 21, 2022 19:0574,618391,921,105364,629,000998,0002,281,472
12Jul 21, 2022 19:0574,626388,521,412363,667,0001,998,0002,433,024