It can't.
Try benchmark sequential access on array to see sub-nanosecond per item. That's fast.
> Even though List is very fast across the board no data-structure can be the fastest at everything.
This feels like a case in which everything is sufficiently well-implemented that the No Free Lunch Theorem [1] starts to play a role.