Hackerrank – Project Euler+ #007 – 10001st prime

Hackerrank – Problem description

The problem description – Hackerrank.


The challenge has upper constraint that we could have at most 10 001 prime numbers from the smallest (2).

I found out that the upper bound is the number 104 743. There exist first 10 001 prime numbers. We calculate list all of them and print the required index of the prime number.

I created solution in:

All solutions are also available on my GitHub profile.


Leave a Reply

Your email address will not be published. Required fields are marked *