PRIME NUMBERS LIST#callange#

Question

Hi there!
just for the fun of it ,write a code to print out the list of all prime numbers less than a certain value!
Lets see who will go highest!!

Happy Coding

https://code.sololearn.com/cHgt6aag99I8/?ref=app

Answer 1

check this java version i think you like!!
https://code.sololearn.com/c8KCZTNWXzC8/?ref=app

Answer 2

i win. works up to n<11220046696331
https://code.sololearn.com/cQq22e5PF7wY/?ref=app

Answer 3

Thaks for your effort.

Be Well
and
Happy Coding

Answer 4

I could go upto primes less than 14500 when the stars were perfectly alighned and the wind and tide were favourable!
:- )
15000 with the help of some luck.
Solo learn IDE is the bench mark!

Answer 5

I tried to make it twice as fast.I could only once get upto 20,000 .And 25,000 when the connection was good.
https://code.sololearn.com/ct5H3HqzBxht/?ref=app

Answer 6

It is noteworthy that when square root is introduced into the code as below ; Code will give time limit around 5500 whereas the code (2) would go upto 20000.
I just hope that sololearn IDE works independent of internet speed and I have not waisted everybodies time.

Happy Coding
https://code.sololearn.com/cBLj66I3xJAp/?ref=app

Answer 7

https://code.sololearn.com/c8tfg3EUscNT/?ref=app

Answer 8

My executes different theory of prime numbers, not as fast as you guys though...
https://code.sololearn.com/cSDpaE2zNtjZ/#py

Answer 9

https://code.sololearn.com/cX3s5Z60JFhS/?ref=app

Answer 10

https://code.sololearn.com/cjluzxU72b4t/?ref=app

Answer 11

https://code.sololearn.com/cGQRSBHN2UPH/?ref=app

Answer 12

2^77217932-1. if you find bigger you win 150.000 $

Answer 13

All prime numbers in interval. Input begin and end of interval.
https://code.sololearn.com/cMC3JLRv0T04/?ref=app

Answer 14

https://code.sololearn.com/cJc7ZrQFexKa/?ref=app
Updated.

Answer 15

Very strange, but this code runs a little faster than my previous one. The previous code produced numbers up to 13000, and this one up to 13500.
Although here I did not apply almost any optimization, divided into odd ones. And in previous code, I only divided into the already found prime numbers. It is possible that the overhead of organizing an array of found prime numbers exceeded the savings from a reduction in the number of divisions.
https://code.sololearn.com/cBF6i9cbOh3c/?ref=app