C Exercises: Get the 1001st prime number

C Programming Practice: Exercise-23 with Solution

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
The first six prime numbers are 2, 3, 5, 7, 11, and 13.
Write a C programming to get the 1001st prime number?

C Code:

#include <stdio.h>
int main(void)
  char *s;
  size_t i;
  unsigned ctr = 0;
  size_t n = 1000000;
  const unsigned target_val = 1001;
  s = calloc(n, sizeof *s);
  for (i = 2; i < n; i++) {
    if (!s[i]) {
      size_t j;
      if (ctr == target_val) {
        printf("%lu\n", i);
      for (j = i*2; j < n; j += i) {
        s[j] = 1;
  return 0;

Sample Output:



C Programming Flowchart: Get the  1001st prime number.

C Programming Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a C programming to find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
Next: Write a C programming to find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?

What is the difficulty level of this exercise?

C Programming: Tips of the Day

The tilde operator in C:

The ~ operator is bitwise NOT, it inverts the bits in a binary number:

NOT 011100
  = 100011

Ref : https://bit.ly/3DR1N24