Prime check using multi thread

prime_check_multi_threaded.py

#! /usr/bin/python3

import concurrent.futures
from math import floor, sqrt
import time


def is_prime(number: int) -> bool:
    if not (number & 1): return 0
    iteration = floor(sqrt(number)) + 1
    for i in range(3, iteration, 2):
        if not (number % i): return 0
    return 1

def main() -> int:
    h_range = 100_000
    start_time = time.time()
    max_workers = 10

    with concurrent.futures.ThreadPoolExecutor(max_workers=max_workers) as executor:
        futures = [executor.submit(is_prime, number) for number in range(h_range + 1)]
        total_prime = 0
        for prime_count in concurrent.futures.as_completed(futures):
            try:
                total_prime += prime_count.result()
            except Exception as e:
                print(f"An error occurred: {e}")


    end_time = time.time()
    print(f"Total execution time is {end_time - start_time} \
            where count of primes is {total_prime}")

if __name__ == '__main__':
    main()