New Sign up free, 10 calls on us. Up to $1, no card needed.

Claude Haiku 5.5 vs Gemini 3.7 Flash

vs

Which one, when

gemini-3.7-flash costs $0.75 input and $3.75 output with $0.075 cache reads; claude-haiku-5-5 costs $0.1 and $0.5 with $0.01 cache reads, 7.5x less on every rate. Both offer about a million tokens of context (1048576 and 1000000). claude-haiku-5-5 allows 128000 output tokens against 65536 and lets you switch thinking off, but bills prompts above 100000 tokens at 5x, which still leaves it the cheaper one. gemini-3.7-flash takes audio and video input. Pick gemini-3.7-flash when the input is audio or video, and claude-haiku-5-5 otherwise.

Benchmarks

Claude Haiku 5.5: the vendor has not published benchmark scores.

Above averageNo peer higherGemini 3.7 Flash17 / 243 / 24
Claude Haiku 5.5 Gemini 3.7 Flash other models measured peer average ★ no peer scored higher
DeepSWE 1.1
N/A
65.3%
BioMysteryBench hard
N/A
43.5%
OSWorld 2.0
N/A
47.9%
Finance Agent v2
N/A
59%
Harvey Lab-AA
N/A
90.7%
HLE-Verified
N/A
53.6%
AutomationBench (v1.0.6)
N/A
52.3%
LVBench
N/A
no peer scored higher 85.4%

Vendor-published: Alibaba (Qwen) Anthropic DeepSeek Google Moonshot OpenAI Tencent Z.ai

Pricing

Claude Haiku 5.5 Gemini 3.7 Flash Δ
Input / 1M tokens $0.1 $0.75 0.13×
Output / 1M tokens $0.5 $3.75 0.13×
Cache read / 1M tokens $0.01 $0.075 0.13×
Cache write 1.25x (5m) / 2x (1h) - -

Rates from the live catalogue at build time; each model page carries the current rate card.

Where they sit · input price per 1M tokens across all 78 chat models on this billing unit (log scale)

$0.05 · Qwen3 VL Flash $30 · GPT-5.4 Pro

Capabilities

Claude Haiku 5.5 Gemini 3.7 Flash
Tool calling yes yes
Thinking control configurable yes (vendor dial not published)
Structured output yes yes
Prompt caching explicit (you mark the prefix) implicit + explicit
Cache lifetime 5m default, 1h option not published
Minimum cached prefix 1024 tokens 4096 tokens

Specs

Claude Haiku 5.5 Gemini 3.7 Flash
Input modalities text image text image audio video
Output modalities text text
Released 2026-10-07 2026-08-13
Knowledge cutoff 2026-06 2026-03
Context window 1M 1M
Max output 128K 66K
Thinking parameter output_config.effort -
Accepted values
output_config.effort
  • low
  • medium
  • high
  • xhigh
  • max
-
Default medium -

Specs are transcribed from each vendor’s documentation; a row a vendor does not publish is left out rather than inferred. Full sources: Claude Haiku 5.5 · Gemini 3.7 Flash

One prompt, both models, measured through the gateway

PROMPT Explain to a CFO, in exactly three sentences, why our LLM bill doubled after we enabled reasoning. CHECK exactly 3 sentences

Claude Haiku 5.5 passed · 3 sentences

Enabling reasoning makes the model generate a long internal chain of thought before its answer, and those thinking tokens are billed as output tokens, which cost several times more than input tokens. The model often produces many times more output per request than it did without reasoning, so the per-call cost rises even when the visible answer looks about the same length. Because that extra spend scales with every request, the bill roughly doubled, and we can control it by setting reasoning budgets, using reasoning only for tasks that need it, or routing simpler requests to a non-reasoning model.

out 332 tok (+159 thinking) latency 2.9 s

Gemini 3.7 Flash passed · 3 sentences

Enabling reasoning causes the model to generate a high volume of invisible "thinking tokens" behind the scenes to deliberate and solve complex logic before delivering a final response. Because our vendor bills strictly on token volume, this additional internal computation effectively doubled our billable output per query. In short, our costs increased because we are now paying for the extra compute capacity required to produce significantly higher-accuracy answers.

out 878 tok (+799 thinking) latency 6.9 s

Instruction following (exactly three sentences, so countable), audience shaping (CFO register), and the hidden-thinking billing gap the token meters below expose.

PROMPT This function is supposed to return the longest run of consecutive equal items, but callers report it is off by one on single-element inputs and misses runs that end at the last index. Fix it and explain the bug in one paragraph. CHECK fix passes tests

Claude Haiku 5.5 passed · 8/8 cases

```python def longest_run(xs): if not xs: return 0 best = cur = 1 for i in range(1, len(xs)): if xs[i] == xs[i - 1]: cur += 1 else: cur = 1 best = max(best, cur) return best ``` The bug is that `cur` counts adjacent equal *pairs*, not run *elements*. A run of k equal items produces k−1 matching pairs, so the function returns one less than the true length, and a single-element input produces no pairs at all, so it returns 0 instead of 1. Resetting `cur` to 0 on a mismatch compounds this by starting every run one step behind. The fix starts both `cur` and `best` at 1 (a non-empty list always has a run of at least one element), resets `cur` to 1 on a mismatch, and updates `best` after every element rather than only inside the equal-branch. The empty-list guard keeps the function from returning 1 for `[]`. […]

out 1012 tok (+591 thinking) latency 6.0 s

Gemini 3.7 Flash passed · 8/8 cases

Here is the corrected function: ```python def longest_run(xs): if not xs: return 0 best = 1 cur = 1 for i in range(1, len(xs)): if xs[i] == xs[i - 1]: cur += 1 else: cur = 1 best = max(best, cur) return best ``` ### Explanation of the Bug The original function tracked equal adjacent transitions instead of the actual number of elements in a run, causing all non-empty run lengths to be undercounted by one (e.g., returning `0` instead of `1` for single-element lists because the loop never executes, and `1` instead of `2` for pairs). Initializing both `best` and `cur` to `1` (after handling empty inputs) and resetting `cur` to `1` on a mismatch ensures every individual element is counted as a valid run of at least length one.

out 1050 tok (+827 thinking) latency 6.4 s

Whether the fix is actually correct (runnable), explanation density, and token efficiency on a bounded task.

PROMPT Extract a JSON object with fields {company, quarter, revenue_usd_m, growth_pct, guidance} from this text. Use null for anything not stated; add no other fields. CHECK valid JSON, schema exact

Claude Haiku 5.5 passed · 5/5 fields, guidance "Formal guidance withheld pending the Q4 "

```json { "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": null, "growth_pct": 11, "guidance": "Formal guidance withheld pending the Q4 close" } ``` Notes: The text gives revenue as 412 but doesn't state the currency, so I left `revenue_usd_m` as null. Growth is "eleven and change," so 11 is an approximation.

out 725 tok (+572 thinking) latency 4.6 s

Gemini 3.7 Flash passed · 5/5 fields, guidance "withheld"

```json { "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": null, "guidance": "withheld" } ```

out 918 tok (+858 thinking) latency 6.2 s

Schema obedience (no invented fields), hallucination pressure (guidance is explicitly withheld), and structured-output path differences.

PROMPT Write a 120-word product announcement for an API gateway feature that caches prompts across providers. Forbidden words: "seamless", "unlock", "game-changer", "revolutionize", "empower". Exactly one sentence must be a question. CHECK 120 words, 0 banned words

Claude Haiku 5.5 passed · 120 words, 0 banned, 1 question

**Introducing Prompt Cache Sync, the newest feature in GatewayOne.** Teams routing requests across OpenAI, Anthropic, and Google have often paid to process the same long system prompts again and again. Now the gateway stores those prompts once and reuses them wherever they appear, regardless of provider. Repeated context is matched by content hash, so cached prefixes return faster and cost less, with no changes to your application code. How much could this save your team? Enable Prompt Cache Sync from the dashboard, and your next billing report will show the difference. Cache entries follow your existing retention settings and can be purged per project at any time. Availability begins this week for all Scale and Enterprise plans worldwide. Start today.

out 2164 tok (+1929 thinking) latency 9.9 s

Gemini 3.7 Flash passed · 120 words, 0 banned, 1 question

Why pay twice for identical AI queries simply because you routed them to different model vendors? Today, we introduce Universal Prompt Caching directly within our unified API gateway architecture. This capability stores repeated prompt contexts across OpenAI, Anthropic, and local models, instantly returning stored results to eliminate redundant computation fees. When your application sends an LLM request, the gateway inspects the payload, identifies semantic matches, and returns accurate cached responses in under ten milliseconds. Engineering teams can now slash inference latency by eighty percent while dramatically reducing monthly token expenditures across diverse production deployments. You retain complete privacy control, flexible cache eviction policies, and granular metrics through a single dashboard. Update your routing settings today to accelerate overall system performance.

out 2858 tok (+2718 thinking) latency 14.1 s

Constraint obedience (word budget, banned-word list, the single question), style fingerprint, and length control.

Switch between them with one line

Both ids are in every tab below; the highlighted pair of lines is the only edit. Same endpoint, same key, same request shape.

from openai import OpenAI

client = OpenAI(
    base_url="https://synthorai.io/v1",
    api_key="sk-syn-...",
)

resp = client.chat.completions.create(
    model="claude-haiku-5-5",
    # model="gemini-3.7-flash",  # uncomment this line, comment the one above
    messages=[{"role": "user", "content": "Summarize this diff"}],
    reasoning_effort="medium",
)
print(resp.choices[0].message.content)

Get your API key →

FAQ

Which is cheaper, Claude Haiku 5.5 or Gemini 3.7 Flash?

Claude Haiku 5.5 is cheaper on the "Input / 1M tokens" row ($0.1 vs $0.75, 7.5× apart). Other rows may point the other way; the table above carries the full rate card, and real cost depends on your mix.

Can I A/B test Claude Haiku 5.5 against Gemini 3.7 Flash without two integrations?

Yes. Both are served through the same OpenAI-compatible endpoint with one API key. Switching is a one-line change to the model id, so you can route a fraction of traffic to each and compare bills directly.

Do Claude Haiku 5.5 and Gemini 3.7 Flash support prompt caching?

Yes. Both bill cache reads below their input rate, so warm-prefix workloads cost less than the list rates suggest. The exact cache-read rows are in the pricing table above.

Related comparisons

From our measured studies