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 listOct 4, 2022 09:29Robert BurkeRobert BurkeScore: 60,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 4, 2022 09:2959,769357,571,260292,867,25702,183,168
2Oct 4, 2022 09:2959,774362,667,774292,892,89702,174,976
3Oct 4, 2022 09:2960,080349,473,760294,392,49702,187,264
4Oct 4, 2022 09:2960,574318,129,707294,816,0001,998,0002,281,472
5Oct 4, 2022 09:2960,604319,088,402294,961,0001,999,0002,281,472
6Oct 4, 2022 09:2960,620320,004,087295,039,0002,000,0002,441,216
7Oct 4, 2022 09:2960,622321,016,392295,047,0002,000,0002,445,312
8Oct 4, 2022 09:2960,630322,344,176295,087,0002,000,0002,281,472
9Oct 4, 2022 09:2960,632319,123,334296,095,0001,000,0002,445,312
10Oct 4, 2022 09:2960,689324,978,064296,375,0001,001,0002,441,216
11Oct 4, 2022 09:2961,167320,898,113297,718,0001,998,0002,281,472
12Oct 4, 2022 09:2961,548326,780,004299,587,0001,997,0002,531,328