Well actually, if you know the O(n^2*logn) algorithm is simple -- using hash function which tells you for A,B and C of the line equation how many rabbits are before and just add.