My solution to Project Euler problem

Project Euler :Summation of Primes

#include<iostream>
#include<cmath>

using namespace std;
bool isPrime(long long var)
{
	for(int i=2;i<=sqrt(var);i++)
	{
		if(var%i==0)
		{
			return false ;
		}
	}
	return true;

}



int main(void)
{
	long long sum=0;
	for(int  i=2;i<2000000;i++)
	{
		if(isPrime(i))
		{	
			sum+=i;	
		}
	}

	cout<<sum<<endl;

	
}