language: C# (mono-2.8)
date: 717 days 7 hours ago
link:
visibility: private 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

public class Euler10
{
    const int limit = 5000000;
    public static void Main()
    {
        bool[] composite = new bool[limit];
        long sum = 2;
        int count = 1;
        for( int i = 3; i < limit; i += 2 ) {
            if (!composite[i]) {
                ++count;
                sum += i;
                if (i * (long)i < limit)
                for( int j = i*i; j < limit; j += i )
                   composite[j] = true;
            }
        }
 
        System.Console.WriteLine("There are " + count.ToString() + " prime numbers less than " + limit.ToString() + " totalling " + sum.ToString());
    }
}