Update README.md

Author: Theoreb

README.md

@@ -1,6 +1,10 @@
 # Optimized-Segmented-SIEVE
 A simple yet very fast optimized version at bit-level of the Segmented Sieves Algorithm to find and count primes numbers up to 1_000_000_000 and more in theory in a few seconds.
 
+### Description of the Project
+
+Hello developers, this project aims to compute primes numbers in the fastest way possible !
+
 ## Test
 (Version 1): Without logs, the program found 455052511 primes numbers between 2 to 10_000_000_000 in 30.887541 seconds with a 596 MB cache on an Intel i7.