Karp-Rabin example

hash(y[0 .. 7]) = 17819

hash(y[1 .. 8]) = 17533

hash(y[2 .. 9]) = 17979

hash(y[3 .. 10]) = 19389

hash(y[4 .. 11]) = 17339

hash(y[5 .. 12]) = 17597

hash(y[6 .. 13]) = 17102

hash(y[7 .. 14]) = 17117

hash(y[8 .. 15]) = 17678

hash(y[9 .. 16]) = 17245

hash(y[10 .. 17]) = 17917

hash(y[11 .. 18]) = 17723

hash(y[12 .. 19]) = 18877

hash(y[13 .. 20]) = 19662

hash(y[14 .. 21]) = 17885

hash(y[15 .. 22]) = 19197

hash(y[16 .. 23]) = 16961

The Karp-Rabin algorithm performs 8 character comparisons on the example.