🎁 新人 免费注册,送 10 次调用,最高 $1,免绑卡。

Claude Sonnet 5 vs Gemini 3.6 Flash

vs

何时使用哪一个 — 经过整理的结论,而非基准测试表格

需要可关闭的明确思考与推理,加上最多 128,000 输出 token 的长答案空间,并且能接受只有文本和图像输入时,选 claude-sonnet-5,每百万输入 $2、输出 $10。需要视频和音频输入时选 gemini-3.6-flash,上下文相近(约 1,048,576 token),输入 $1.5、输出 $7.5、缓存读取 $0.15,音频按每百万音频 token $5 单独计量;注意它的思考无法关闭,最大输出为 65,536。粗略地说,Sonnet 5 在两个方向上每 token 都贵约 1.33 倍。

定价

Claude Sonnet 5 Gemini 3.6 Flash Δ
输入 / 1M tokens $2 $1.5 1.3×
输出 / 1M tokens $10 $7.5 1.3×
缓存读取 / 1M tokens $0.2 $0.15 1.3×
缓存写入 1.25x (5m) / 2x (1h)

费率取自构建时的实时目录;每个模型页面均附有当前的费率卡。

它们的位置 — 以该计费单位计费的所有 63 个 聊天 模型的 每 1M token 的输入价格(对数刻度)

能力

Claude Sonnet 5 Gemini 3.6 Flash
工具使用
思考控制 可配置 始终开启
结构化输出
提示词缓存 显式(由您标记前缀) 隐式 + 显式
缓存生存时间 5m default, 1h option 未公开
最小缓存前缀 1024 个 token 4096 个 token

规格

Claude Sonnet 5 Gemini 3.6 Flash
输入模态 文本 图像 文本 图像 音频 视频
输出模态 文本 文本
发布日期 2026-06-30
知识截止日期 2026-01 2026-03
上下文窗口 1M 1M
最大输出 128K 66K
思考参数
  • thinking.type "adaptive"
  • output_config.effort
thinkingLevel
允许的值
thinking.type
  • adaptive
  • disabled
effort
  • low
  • medium
  • high
  • xhigh
  • max

"enabled" returns 400

  • minimal
  • low
  • medium
  • high
默认值

thinking on (adaptive)

effort
  • high
medium

规格转录自各供应商的文档;若供应商未发布某项数据,则直接省略该行,而非进行推断。 完整来源: Claude Sonnet 5 · Gemini 3.6 Flash

单个 Prompt,两个模型 —— 通过网关实测

提示词 Explain to a CFO, in exactly three sentences, why our LLM bill doubled after we enabled reasoning. 检查 恰好 3 句

Claude Sonnet 5 通过 · 3 sentences

Reasoning mode works by having the model generate extended internal "thinking" steps before producing its final answer, and since we're billed on total tokens, that hidden reasoning text adds significantly to what we pay for—even though you never see it in the output. This is different from simply getting longer visible responses; the model is essentially "showing its work" behind the scenes, and complex prompts can trigger thousands of extra reasoning tokens per request. The upside is improved accuracy on complex tasks, but if we want to control costs, we should selectively enable reasoning only for queries that truly need it, rather than applying it universally.

输出 194 tok 延迟 4.3 s

Gemini 3.6 Flash 通过 · 3 sentences

Enabling reasoning causes the model to generate thousands of internal "thinking" tokens behind the scenes to process logic before delivering the final response. Because our vendor bills us for every token generated—including these intermediate processing steps—our billable output volume per query surged significantly. Since output tokens carry a much higher unit cost than input tokens, this jump in processing volume directly doubled our overall spend.

输出 893 tok (+816 思考) 延迟 4.7 s

指令遵循(恰好三句,可数)、受众适配(面向 CFO 的语气),以及下方 token 计量所暴露的隐藏思考计费缺口。

提示词 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. 检查 修复通过测试

Claude Sonnet 5 通过 · 8/8 cases

## The Bug The function has two related off-by-one issues rooted in the same cause: `cur` and `best` are initialized to `0` instead of `1`, treating run lengths as the number of *matches* between adjacent elements rather than the number of *elements* in the run. This means a single-element input never enters the loop (since `range(1, 1)` is empty) and returns `0` instead of the correct answer of `1`. It also means that for any input, the run length is undercounted by exactly one — a run of 3 equal elements only produces 2 "match" increments, so `best` ends up as 2 instead of 3. The claim that it "misses runs that end at the last index" is actually a symptom of this same undercount: the logic does update `best` correctly on every iteration (including the last), but because it's counting matches instead of elements, the final reported value is always one less than the true longest run. […]

输出 536 tok 延迟 7.1 s

Gemini 3.6 Flash 通过 · 8/8 cases

Here is the fixed function along with an explanation of the bugs: ```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 The original function initialized `cur` and `best` to `0` and incremented `cur` on matching adjacent items, which meant it was counting identical adjacent *pairs* rather than the total number of *elements* in a run. This caused single-element inputs to skip the loop and return `0` instead of `1`, and undercounted all run lengths by 1 (for example, a run of two items at the end of the list resulted in `cur = 1`). […]

输出 2034 tok (+1768 思考) 延迟 10.0 s

修复是否真的正确(可运行)、解释的信息密度,以及在一个边界明确的任务上的 token 效率。

提示词 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. 检查 合法 JSON,schema 精确

Claude Sonnet 5 通过 · 5/5 fields, guidance null

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

输出 348 tok 延迟 5.3 s

Gemini 3.6 Flash 通过 · 5/5 fields, guidance "withheld"

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

输出 2843 tok (+2783 思考) 延迟 13.1 s

schema 服从度(不臆造字段)、幻觉压力(guidance 明确被暂缓给出),以及结构化输出路径的差异。

提示词 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. 检查 120 词,0 个禁用词

Claude Sonnet 5 通过 · 123 words, 0 banned, 1 question

## Introducing Cross-Provider Prompt Caching We're rolling out a new caching layer for our API gateway that works across every major LLM provider you connect through it. Instead of resending identical prompts and paying full price each time, the gateway recognizes repeated requests and serves cached responses in milliseconds—regardless of whether you're routing to OpenAI, Anthropic, or Google. What does this mean for your bill and your latency? Both drop, often significantly, especially for teams running high-volume, repetitive workloads like customer support bots or batch content generation. The cache is configurable per route, with adjustable TTLs and invalidation rules, so you stay in control of freshness versus cost. Available now for all Pro and Enterprise plans. Check your dashboard to enable it today.

输出 259 tok 延迟 4.8 s

Gemini 3.6 Flash 未命中 · 60 words, 0 banned, 0 questions

72: reducing 73: your 74: monthly 75: token 76: spend. S6 (21): 77: You 78: can 79: easily 80: set 81: custom 82: expiration 83: rules, 84: configure 85: TTL 86: settings, 87: and 88: manage 89: cache 90: invalidation 91: across 92: all 93: vendors 94: from 95: one 96: centralized 97: dashboard. S7 (23): 98: Start 99: optimizing […]

输出 4092 tok (+3929 思考) 延迟 16.3 s

约束服从度(字数预算、禁用词表、唯一的那句问句)、文风指纹,以及长度控制。

只需一行代码即可在它们之间切换

两个 ID 都包含在下方的每个选项卡中 — 高亮显示的两行是唯一的修改。相同的端点,相同的密钥,相同的请求结构。

from openai import OpenAI

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

resp = client.chat.completions.create(
    model="claude-sonnet-5",
    # model="gemini-3.6-flash",  # 取消注释此行,注释上一行
    messages=[{"role": "user", "content": "Summarize this diff"}],
    reasoning_effort="medium",
)
print(resp.choices[0].message.content)

获取 API 密钥 →

常见问题

Claude Sonnet 5 和 Gemini 3.6 Flash 哪个更便宜?

在 输入 / 1m tokens 方面,Gemini 3.6 Flash 更便宜($1.5 对比 $2,相差 1.3×)。其他行可能得出相反的结论——上方表格提供了完整信息,实际成本取决于你的组合使用情况。

我可以在不进行两次集成的情况下,对 Claude Sonnet 5 和 Gemini 3.6 Flash 进行 A/B 测试吗?

可以。两者均通过同一个兼容 OpenAI 的端点提供服务,并使用同一把 API 密钥——切换只需更改一行模型字符串,因此你可以将一部分流量路由到各个模型并直接比较账单。

Claude Sonnet 5 和 Gemini 3.6 Flash 支持提示词缓存吗?

是的 —— 两者对缓存读取的计费均低于其输入费率,因此热前缀工作负载的成本低于标价。准确的缓存读取行位于上方的定价表中。

相关对比

来自我们的实测研究