prog challenge: super fast dicks

Given 5gb file filled with random ebooks in ascii.

Write a program that will count the number of times dick appears in a single line.

His name was dick turpin.
Dick was a right dick.
Bobby loves bums.

The program should output: 2

Any language, nobody can win this, but we can mock inept short sighted solutions.

NIGGERS

NIGGERS

NIGGERS

[ENTERPRISE]int main()
{
 long long int nDick = 1342177280; // 5GB / 4B (len("dick"))
 char *l;
 FILE *f = fopen("ebook", "r");
 while((l = getLine(f)) != NULL)
 {
  if(lineDefinitelyNotContains(l, "dick")) nDick--;
 }
 fclose(f);
 printf("Proven to contain %d dicks\n", nDick);
 return 0;
}[/ENTERPRISE]

>>1
Problem is poorly defined. Why should your example output 2?
Is it because (case-sensitive) ``dick'' appears twice?
Is it because there are two lines containing ``dick'' (and if so, is the matching case-sensitive or not?)?
Is it because the line that contains the most (case-insensitive) ``dick'' contains two instances of it?

>>2
please dont be rasist in hear.thankXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

sed '{:q;N;s/\n/ /g;t q}' ebook > ebook// put it all on one line
echo '1 occurrence'

bampu pantsu