Mine

/*Project Euler: Problem 10 *Author: Nick Peaden *Date 13 Feb 2007 */#include <stdio.h>#include <stdlib.h>int main() {    unsigned long int num[78498] = {2}, mod = 2;    double sum = 0.0;    int i = 1, j = 0;    while (mod < 1000000) {        j = 0;        while (j < i) {            if ((mod < num[j]*num[j]) && (mod % num[j])) {                num[i] = mod;                i++;                break;            } else if (!(mod % num[j])) {                break;            }            j++;        }        mod++;    }    for (j = 0; j < i;  j++) sum += num[j];    printf("Terms: %-5d Total: %-10.0f\n", i, sum);    return EXIT_SUCCESS;}