It depends on what you mean by "computation". I assume here you mean that your solution is O(n³) and n ≤ 10³ hence the number 10⁹,  but for each triplet of points you process here, you are making many more auxiliary "computations", each of which take different amounts of time. If I understand you correctly, generally brute forcing 10⁹ cases will not pass in 2 seconds, but I think your continue; and return; statements in your function pruned the search considerably (it can be shown that, by at latest the 12th iteration, there will be an acute angle).