Use segmented sieve, here's a nice tutorial on it: https://forthright48.com/2015/09/segmented-sieve-of-eratosthenes.html

Note that if an integer x in the range [n, n + m] is non-prime, than it should be divisible by some prime number p ≤ P, where , N = 10¹¹ and M = 10⁵. Hence, the required numbers may be found by excluding all non-prime numbers in this range. The performance of the solution may be improved by observing that all the required numbers are odd numbers. A non-prime odd number is the product of two odd numbers.