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 23:12Robert BurkeRobert BurkeScore: 71,674Success
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 23:1271,424404,753,451349,979,81602,281,472
2Jul 21, 2022 23:1271,441413,492,664350,062,36202,289,664
3Jul 21, 2022 23:1271,465405,076,172350,176,74402,285,568
4Jul 21, 2022 23:1271,626377,403,542349,969,000999,0002,281,472
5Jul 21, 2022 23:1271,665376,291,597350,158,0001,000,0002,281,472
6Jul 21, 2022 23:1271,671376,829,713350,189,0001,000,0002,428,928
7Jul 21, 2022 23:1271,674376,906,127350,202,0001,000,0002,428,928
8Jul 21, 2022 23:1271,685370,154,986350,255,0001,000,0002,277,376
9Jul 21, 2022 23:1271,700377,883,316350,331,0001,000,0002,281,472
10Jul 21, 2022 23:1271,725376,734,097349,455,0001,996,0002,281,472
11Jul 21, 2022 23:1271,762377,495,354350,636,000998,0002,281,472
12Jul 21, 2022 23:1273,416381,534,566358,737,000999,0002,277,376