In this task you would be given an integer N you have to output the nearest prime to the integer.
If the number is prime itself output the number.
The input N is given in a single line,the inputs are terminated by EOF.The number of inputs would not exceed 10000 values.
The challenge is to implement the fastest solution so that it can process a maximum of 10000 values as fast as possible.
299246598 211571591 71266182 645367642 924278231
299246587 211571573 71266183 645367673 924278233
- N is less than 2^64
- Take care of your fingers do not use more than 4096 bytes in your solution.
- You can use any language of your choice as long as you are not using it's any inbuilt things for the primes.
- Fastest solution,with the most efficient time complexity wins!
This is a easier version of the this same problem (with N < 2^31) so that you may try checking your approach in smaller cases before building it up for this actual problem.