How to make your AI Agent 111x cheaper and 2.5x faster at data aggregation
A recent test compared the performance of Google's Gemini 3.5 Flash model with the Neonia MCP architecture for data aggregation tasks. The Neonia MCP approach proved to be significantly faster and cheaper, completing the task in 15.54 seconds and using only 650 tokens. In contrast, the Gemini model took 38.89 seconds and consumed 72,361 tokens for the same task.
- ▪Google's Gemini 3.5 Flash model was tested for data aggregation tasks.
- ▪The Neonia MCP architecture completed the task 2.5 times faster and was 111 times cheaper than the Gemini model.
- ▪The Gemini model accurately processed 72,286 tokens without errors but at a high cost in terms of time and resources.
DEV.to (Top) files mainly under programming. We currently carry 4,924 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | DEV.to (Top) |
| Canonical URL | https://dev.to/olex_green/how-to-make-your-ai-agent-111x-cheaper-and-25x-faster-at-data-aggregation-ii7 |
| Publication time | Tue, 26 May 2026 06:08:08 +0000 |
| Retrieval time | 2026-05-26T06:37:45.433Z |
| Last seen | 2026-05-26T06:37:45.433Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | H9y4rdWOFut4 |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
try { if(localStorage) { let currentUser = localStorage.getItem('current_user'); if (currentUser) { currentUser = JSON.parse(currentUser); if (currentUser.id === 335474) { document.getElementById('article-show-container').classList.add('current-user-is-article-author'); } } } } catch (e) { console.error(e); } Olex Tkachuk Posted on May 26 How to make your AI Agent 111x cheaper and 2.5x faster at data aggregation #ai #rust #mcp #agents Google recently released an incredibly fast new model — Gemini 3.5 Flash. As someone building infrastructure for autonomous agents, I decided to put it through a rigorous crash test on a real-world data aggregation task to see how it handles massive context loads. The Benchmark Task The challenge was simple, but computationally heavy.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at DEV.to (Top).
Discussion
0 commentsMore from DEV.to (Top)
