concurrent_futures_processpool_parallel_prime_check.py

1import hashlib
2from concurrent.futures import ProcessPoolExecutor
3
4def check_prime(n):
5    if n < 2:
6        return False
7    if n == 2:
8        return True
9    if n % 2 == 0:
10        return False
11    for i in range(3, int(n**0.5) + 1, 2):
12        if n % i == 0:
13            return False
14    return True
15
16def main():
17    # The numbers to check
18    PRIMES = [112272535095293, 112582718962171, 112272535095293, 
19              115280098190773, 1157920892373161]
20
21    # We use a ProcessPoolExecutor to run tasks in parallel
22    with ProcessPoolExecutor() as executor:
23        for number, is_prime in zip(PRIMES, executor.map(check_prime, PRIMES)):
24            print(f"{number} is prime: {is_prime}")
25
26if __name__ == '__main__':
27    main()