Update app.py

app.py

@@ -6,7 +6,8 @@ import os
 from math import isqrt
 
 # Path to save the primes
-PRIME_SAVE_PATH = "/Prime-Numbers/primes.txt"
+PRIME_SAVE_PATH = "primes.txt"
+lock = threading.Lock()  # Thread lock to control file access
 
 # Function to check if a number is prime
 def is_prime(n):
@@ -35,8 +36,11 @@ def load_saved_primes():
 
 # Function to save new primes to file
 def save_primes_to_file(prime_list):
-    with open(PRIME_SAVE_PATH, "a") as file:
-        file.write("\n".join(prime_list) + "\n")
+    with lock:  # Ensure only one process writes to the file at a time
+        with open(PRIME_SAVE_PATH, "a") as file:
+            file.write("\n".join(prime_list) + "\n")
+            file.flush()  # Ensure data is written to disk
+            os.fsync(file.fileno())  # Force file system to sync
 
 # Background prime number generator function
 def prime_generator():
@@ -58,13 +62,16 @@ def prime_generator():
             processes.append(process)
         
         # Collect primes from all processes
+        all_new_primes = []
         for process in processes:
             process.join()
             primes = queue.get()
-            prime_list.extend(primes)
+            all_new_primes.extend(primes)
+        
+        prime_list.extend(all_new_primes)
         
         # Save the newly found primes to the file
-        save_primes_to_file(primes)
+        save_primes_to_file(all_new_primes)
         
         num += num_processes * batch_size
         time.sleep(0.1)  # Adjust this to control responsiveness and resource usage