I hope that isn't 14 seconds for a single test. There are 100 performance tests ( at least in JS, can't see Python ).

I'm a 100% sure I made a solution that's not O(n^2). I've tried it on my machine with a test case of list of 120K random numbers ranging from -1000 to 1000. The solution took about 14 seconds, and with the normal solution (from the standard kata, which is O(n^2)) it took more than 2 minutes.

This kata is surely hard, I'll try to make it...

why did you stop at 2520? there were no constraints in the problem, and the number 2520 isn't common, it's usually a power of 10 or power of 2

bruuuuh XD

Thanks! A great thing to know about for beginners in python.

expected:<1.307530663082039E16> but was:<1.3075306630820394E16>
bro...