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 23, 2022 09:18Robert BurkeRobert BurkeScore: 63,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2022 09:1862,311359,161,417305,325,31302,183,168
2Jul 23, 2022 09:1862,345367,743,064305,490,14502,183,168
3Jul 23, 2022 09:1862,515367,622,792306,321,52802,179,072
4Jul 23, 2022 09:1863,746337,700,977311,356,0001,001,0002,281,472
5Jul 23, 2022 09:1863,747335,731,746311,361,0001,001,0002,441,216
6Jul 23, 2022 09:1863,752339,705,504311,385,0001,001,0002,281,472
7Jul 23, 2022 09:1863,754337,055,377310,397,0001,996,0002,449,408
8Jul 23, 2022 09:1863,770344,686,352311,473,0001,001,0002,281,472
9Jul 23, 2022 09:1863,778335,802,058310,517,0001,996,0002,281,472
10Jul 23, 2022 09:1863,797347,015,056310,608,0001,997,0002,281,472
11Jul 23, 2022 09:1863,817342,203,249311,702,000999,0002,281,472
12Jul 23, 2022 09:1864,085341,013,887312,018,0002,000,0002,449,408