The major target of this approach is performance improvement when looking for the highest prime number less than 10.000.000 with a given sum of decimal digits. The problem requires implementation of sieve of Eratosthenes

Source: LXer – Solution another YandexQ question via sieve of eratosthenes in Python