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 06:03Robert BurkeRobert BurkeScore: 81,663Success
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 06:0378,047432,621,363382,431,37002,281,472
2Jul 21, 2022 06:0378,079437,259,443382,585,53402,289,664
3Jul 21, 2022 06:0381,608426,208,787398,878,000999,0002,281,472
4Jul 21, 2022 06:0381,623426,392,205398,955,000999,0002,281,472
5Jul 21, 2022 06:0381,629421,797,346398,983,000999,0002,281,472
6Jul 21, 2022 06:0381,631424,589,279397,992,0001,999,0002,281,472
7Jul 21, 2022 06:0381,663427,556,126399,149,0001,000,0002,433,024
8Jul 21, 2022 06:0381,683430,057,599400,245,00002,281,472
9Jul 21, 2022 06:0381,692425,236,363400,290,00002,433,024
10Jul 21, 2022 06:0381,694419,404,825400,299,00002,428,928
11Jul 21, 2022 06:0381,756431,781,168398,605,0001,998,0002,428,928
12Jul 21, 2022 06:0389,885501,527,768440,437,23802,289,664