In computer science, we learn about run time complexity:

http://en.wikipedia.org/wiki/Big_O_notation

The basic idea is that the size of the input data has an effect on how long it takes the program to run. For example, we say that the quicksort algorithm has a run time complexity of O(n log n), because as the input size n grows, it takes n * log(n) time to run.

That means that people are penalized just because they have more data. Does that seem fair?

In New Computer Science, we call this the "Constant Time Barrier". Ideally, everything will run quickly regardless of how much data you have.

Psychotic shatters the Constant Time Barrier.