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

Gemini 3.6 Flash vs GLM-5.3-Flash

vs

什么时候选哪个

glm-5.3-flash 成本更低:每百万 token 输入 $0.15、输出 $0.5,而 gemini-3.6-flash 为 $0.75 和 $3.75,输入便宜约 5 倍,输出便宜 7.5 倍,并且最多可输出 163840 个 token(gemini-3.6-flash 为 65536)。如果输入中包含音频,请选 gemini-3.6-flash,因为 glm-5.3-flash 只支持文本、图像和视频;需要它 2026-03 的知识截止日期时也适合选它。两者的上下文长度几乎相同(1048576 对 1000000),并且都无法关闭 thinking。

Benchmark 成绩

高于同类均值无更高分Gemini 3.6 Flash6 / 181 / 18GLM-5.3-Flash4 / 61 / 6
Gemini 3.6 Flash GLM-5.3-Flash 其他参测模型 同类均值 ★ 没有模型得分更高
DeepSWE 1.1
48.6%
63.4%
BioMysteryBench hard
41.2%
N/A
OSWorld 2.0
33.8%
N/A
GDPval-AA v2 Elo · 1504-1773 据 Z.ai 公布 · 2026-09-04
N/A
没有模型得分更高 1773
Harvey Lab-AA
85.1%
N/A
Humanity's Last Exam with tools
N/A
55.3%
Agents' Last Exam
N/A
26.3%
LVBench
84.2%
N/A

供应商公布: Alibaba (Qwen) Anthropic DeepSeek Google Moonshot OpenAI Tencent Z.ai

价格

Gemini 3.6 Flash GLM-5.3-Flash Δ
输入 / 1M token $0.75 $0.15 5×
输出 / 1M token $3.75 $0.5 7.5×
缓存读取 / 1M token $0.075 $0.03 2.5×

价格取自构建时的实时目录,最新价格见各模型页面。

两个模型所处的位置:全部 79 个按同一单位计费的聊天模型的每 1M token 输入价分布(对数刻度)

Gemini 3.6 Flash · $0.75 GLM-5.3-Flash · $0.15
$0.05 · Qwen3 VL Flash $30 · GPT-5.4 Pro

能力

Gemini 3.6 Flash GLM-5.3-Flash
工具调用 是 是
思考控制 始终开启 始终开启
结构化输出 是 是
提示词缓存 隐式 + 显式 隐式(自动)
缓存有效期 未公布 未公布
最小缓存前缀 4096 个 token 未公布

规格

Gemini 3.6 Flash GLM-5.3-Flash
输入模态 文本 图像 音频 视频 文本 图像 视频
输出模态 文本 文本
发布日期 2026-07-21 2026-08-26
知识截止日期 2026-03 -
上下文窗口 1M 1M
最大输出 66K 164K
思考参数 thinkingLevel reasoning_effort
可选值
  • minimal
  • low
  • medium
  • high
reasoning_effort
  • low
  • high
  • max
默认值 medium max

规格照录自各供应商的文档;供应商没有公布的项目,对应的行直接省略,不做推断。 完整来源: Gemini 3.6 Flash · GLM-5.3-Flash

同一条提示词,两个模型,经网关实测

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

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

GLM-5.3-Flash 通过 · 3 sentences

Enabling reasoning means the model now generates thousands of invisible "thinking" tokens before each visible answer, and we're billed for those hidden tokens at full output rates—our most expensive tier. Since output tokens cost 3–5x more than input tokens, that hidden thinking volume compounds across every request, which is why the bill doubled rather than edged up. If the spend concerns you, the fix is straightforward: route only complex queries to reasoning models and keep simple tasks on standard ones, which can reclaim a meaningful share of that cost without losing accuracy where it matters.

输出 742 tok (+626 思考) 延迟 23.2 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. 检查 修复通过测试

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

GLM-5.3-Flash 通过 · 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 best = max(best, cur) else: cur = 1 return best ``` **The bug:** `cur` is supposed to hold the length of the current run, but it's seeded with `0` and reset to `0` on a mismatch instead of `1` — and since the loop starts at index 1, the first element of every run never passes through the `==` branch and so never gets counted at all. That means `cur` actually holds *run length minus 1* for every run, so every run is underreported by one: a single-element input never enters the loop and returns 0 instead of 1, and a run of length n returns n − 1 (e.g., `[3, 3, 3]` returns 2). […]

输出 2462 tok (+2138 思考) 延迟 29.1 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

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

GLM-5.3-Flash 通过 · 5/5 fields, guidance "Withheld pending the Q4 close"

```json { "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": 11, "guidance": "Withheld pending the Q4 close" } ``` Notes on judgment calls: revenue of 412 is on a constant-currency basis as stated; growth of "eleven and change" is approximated as 11 since no precise figure is given.

输出 717 tok (+616 思考) 延迟 9.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 个禁用词

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

GLM-5.3-Flash 通过 · 120 words, 0 banned, 1 question

Introducing Cross-Provider Prompt Cache, the newest feature in our API gateway. Today, teams send identical prompts to multiple LLM providers and pay full price each time. Why duplicate that work and cost? With Cross-Provider Prompt Cache, your gateway stores prompt-response pairs and serves repeated requests from cache, regardless of which provider handles the call. The result: lower latency, reduced spend, and consistent outputs across OpenAI, Anthropic, Google, and self-hosted models. Configure cache policies per route, set TTLs, and invalidate entries instantly through the dashboard or API. Built-in analytics show hit rates and savings in real time. Enable the cache with a single flag, no code changes required. Available today on all paid plans. Contact sales for enterprise volume pricing details.

输出 2095 tok (+1937 思考) 延迟 20.2 s

是否守住约束(字数预算、禁用词表、只能有一个问句)、文风特征,以及长度控制。

改一行代码就能在两个模型之间切换

下方每个标签页里都有两个模型 ID,高亮的那两行是唯一要改的地方。端点不变,API key 不变,请求结构也不变。

from openai import OpenAI

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

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

获取 API key →

常见问题

Gemini 3.6 Flash 和 GLM-5.3-Flash 哪个更便宜?

按「输入 / 1M token」算,GLM-5.3-Flash 更便宜($0.15 对 $0.75,相差 5.0×)。其他计费项的结论可能相反,完整价格见上方表格,实际成本取决于你的用量构成。

不用分别集成两次,就能对 Gemini 3.6 Flash 和 GLM-5.3-Flash 做 A/B 测试吗?

可以。两个模型走同一个 OpenAI 兼容端点,用同一个 API key,切换时只要改一行里的模型名,所以可以给两个模型各分一部分流量,直接对比账单。

Gemini 3.6 Flash 和 GLM-5.3-Flash 支持提示词缓存吗?

支持。两个模型的缓存读取价都低于各自的输入价,所以前缀能反复命中缓存的负载,实际成本会比按官网价估算的低。具体的缓存读取价见上方价格表。

相关对比

我们的实测研究