Optimize Sieve of Eratosthenes for big numbers in Python
You can make this part a bit faster:
            for j in range(i*3, limitN, i*2):
                not_prime.add(j)

Better start at i*i, and better don't do your own loop. So it becomes:
            not_prime.update(range(i*i, limitN, i*2))