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 18:00Robert BurkeRobert BurkeScore: 74,569Success
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 18:0070,547402,167,035345,681,30302,293,760
2Jul 21, 2022 18:0070,562410,345,700345,755,35802,293,760
3Jul 21, 2022 18:0070,566398,990,209345,773,91602,285,568
4Jul 21, 2022 18:0074,527395,455,456364,183,0001,000,0002,428,928
5Jul 21, 2022 18:0074,569388,879,997365,388,00002,420,736
6Jul 21, 2022 18:0074,569394,405,440365,388,00002,281,472
7Jul 21, 2022 18:0074,569393,391,948365,390,00002,281,472
8Jul 21, 2022 18:0074,578390,895,788364,430,0001,001,0002,281,472
9Jul 21, 2022 18:0074,578391,383,478364,435,000998,0002,519,040
10Jul 21, 2022 18:0074,616396,091,352365,619,00002,281,472
11Jul 21, 2022 18:0074,624391,085,245363,660,0001,998,0002,424,832
12Jul 21, 2022 18:0082,621430,747,045403,845,000999,0002,416,640