What is fastest depends on the implementation of the operator used to reach the data. A dumb for loop will usually be fastest, provided that the reaching operator (QList::at() in the first case, next() and * operator in remaining cases) doesn't introduce any unnecessary overhead.