Time per task sums measured search time and model time. In an ideal setup, added search latency remains low. However, a provider that is fast per search call can still add more total time. This occurs when the model must run more searches or produce more tokens to reach an answer.
Keenable Search (realtime) has the fastest average search calls on the board: 0.34s per query. It also has the lowest total time per task (15.1s), and scores 67 on the Artificial Analysis Search Index.
Among Parallel's tiers, turbo has the fastest average search calls: 0.51s per query vs. 1.03s for Parallel Search (basic). But the basic tier still scores higher on quality: 73 vs. 67. The turbo tier also runs more searches per task (13.6 vs. 9.03), so the two land close on total time per task: 18.8s vs. 20.4s.
The model only baseline takes ~13.8s per task with zero search time. The DeepSearchQA and BrowseComp tasks explain this result.
These tasks suit a model plus search combination: search results give the model context for its answer.
For example, on BrowseComp tasks without search tools, the model only baseline writes ~4,100 output tokens per task, compared with ~1,600 to ~2,900 for the provider results.
AA-Omniscience shows the opposite pattern. With search tools, the model reads and reconciles sources, and then writes roughly two to three times as many output tokens as the baseline.