fork download 
  1. import java.util.*;
  2.  
  3. class Primes {
  4.  
  5. 	public static void main(String[] args) {
  6. 		long t = System.currentTimeMillis();
  7. 		List<Integer> primes = new ArrayList<>();
  8. 		primes.add(2);
  9. 		int cur = 3;
  10. 		while (primes.size() < 100000) {
  11. 			for (Integer x : primes) {
  12. 				if (x * x > cur) {
  13. 					primes.add(cur);
  14. 					break;
  15. 				}
  16. 				if (cur % x == 0) {
  17. 					break;
  18. 				}
  19. 			}
  20. 			cur += 2;
  21. 		}
  22. 		t = System.currentTimeMillis() - t;
  23. 		System.out.println(primes.get(primes.size() - 1));
  24. 		System.out.println(t + "ms");
  25. 	}
  26.  
  27. }
Success #stdin #stdout 0.84s 380160KB
comments (?)
stdin 
Standard input is empty
stdout 
1299709
776ms
https://ideone.com/QE8U0I
Primes, trial division
language:
Java (12.0.1)
created:
10 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!