void problem10()

    {
        unsigned long long int iter = 2, sum = 0;

        static bool prime[PRIME_LIMIT];

        for (unsigned long long int i = 0; i < PRIME_LIMIT; i++)
        {
            prime[i] = true;
        }

        unsigned long long int limit = ceil(sqrt(PRIME_LIMIT));

        for (unsigned long long int i = 2; i <= limit; i++)
        {
            if (prime[i])
            {
                for (unsigned long long int j = i*i; j < PRIME_LIMIT; j += i)
                {
                    prime[j] = false;
                }
            }
        }

        for (unsigned long long int i = 2; i < PRIME_LIMIT; i++)
        {
            if (prime[i])
            {
                sum += i;
                //printf("Primes are: %dn", i);
            }
        }
            printf("Sum of prime is: %llun", sum);
    }

double sqrt(double x);
double ceil(double x);