新用戶 免費註冊,送 10 次呼叫,最高 $1,免綁卡。

Claude Opus 5 vs GLM-5

vs

何時用哪一個

claude-opus-5 接受圖像和文字輸入,上下文視窗 1,000,000 token,是 glm-5 的 200000 的五倍,所以含圖像或整庫上下文的提示選它。glm-5 只接受文字,但便宜得多:輸入低約 5 倍($1 對 $5),輸出低 7.8 倍($3.2 對 $25),快取讀取 $0.2 對 $0.5,最大輸出略大,131072 token 對 128000。兩者都可關閉思考。能裝進 200000 token 的大批量文字、程式碼和工具工作選 glm-5。

Benchmark 成績

高於同儕均值無人分數更高Claude Opus 514 / 147 / 14GLM-515 / 522 / 52
Claude Opus 5 GLM-5 其他被測模型 同儕均值 無人分數更高
SWE-Bench Pro
N/A
55.1%
BioMysteryBench hard
無人分數更高 49.4%
N/A
OSWorld 2.0
無人分數更高 70.6%
N/A
Cybergym
N/A
43.2%
HealthBench Professional
59.8%
N/A
GDPval-AA v2 Elo · 642-1861
無人分數更高 1861
N/A
Legal Agent Benchmark held-out
11.7%
N/A
Humanity's Last Exam no tools
56.3%
27.2%
BrowseComp
90.8%
62%

廠商公布: Alibaba (Qwen) Anthropic ByteDance DeepSeek Google MiniMax Moonshot OpenAI Tencent Z.ai

定價

Claude Opus 5 GLM-5 Δ
輸入 / 1M tokens $5 $1
輸出 / 1M tokens $25 $3.2 7.8×
快取讀取 / 1M tokens $0.5 $0.2 2.5×
快取寫入 1.25x (5m) / 2x (1h) - -

費率取自建置時的即時目錄;各模型頁面皆附有目前的費率卡。

它們的相對位置 — 在此計費單位下,所有 64 個 聊天 模型的 每 1M tokens 的輸入價格(對數尺度)

Claude Opus 5 · $5 GLM-5 · $1
$0.05 · Qwen3 VL Flash $30 · GPT-5.4 Pro

能力

Claude Opus 5 GLM-5
工具使用
思考控制 可配置 可配置
結構化輸出
提示快取 顯式(由您標記前綴) 隱式(自動)
快取生命週期 5m default, 1h option 未公開
最小快取前綴 1024 個 token 未公開

規格

Claude Opus 5 GLM-5
輸入模態 文字 影像 文字
輸出模態 文字 文字
發布日期 2026-07-24 2026-02-12
知識截止日期 2026-05 -
上下文視窗 1M 200K
最大輸出 128K 131K
思考參數
  • thinking.type
  • output_config.effort
thinking.type
可接受的值
thinking.type
  • adaptive
  • disabled
effort
  • low
  • medium
  • high
  • xhigh
  • max
thinking.type
  • enabled
  • disabled
預設值

thinking on

effort
  • high (Claude API and Claude Code)
enabled, and on GLM-5 the model automatically determines whether to think

規格摘錄自各供應商的文件;供應商未發布的資料列會直接省略,而非自行推測。 完整來源: Claude Opus 5 · GLM-5

單一提示詞,兩款模型 — 經由閘道測量

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

Claude Opus 5 通過 · 3 sentences

When reasoning is enabled, the model generates a hidden chain of "thinking" tokens before it writes the visible answer, and those internal tokens are billed at the output rate even though no one ever sees them — commonly 3–10x more tokens than the response itself. Because output tokens are priced several times higher than input tokens, that added volume hits us at our most expensive rate, which is why the bill roughly doubled while our request count stayed flat. The spend is controllable: we can cap the reasoning budget per call, route only genuinely hard requests to reasoning mode and cheaper models for the rest, and track cost per successfully completed task rather than cost per token, since a single correct answer usually beats three cheap retries plus human cleanup.

輸出 529 tok 延遲 9.0 s

GLM-5 通過 · 3 sentences

Enabling reasoning forces the model to perform multiple hidden steps to "think" through a problem, drastically increasing the volume of data processed per query compared to a standard response. Because our billing is directly tied to this processing volume, the additional computational work required for higher accuracy has proportionally doubled our consumption. Essentially, the spike reflects a trade-off where we are paying a higher variable cost to secure significantly better analytical outcomes.

輸出 1393 tok (+1308 思考) 延遲 36.0 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 Opus 5 通過 · 8/8 cases

## Fixed version ```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 if cur > best: best = cur return best ``` ## The bug The counters were tracking the wrong quantity: `cur` counted *matching adjacent pairs* rather than *elements in the current run*, and both counters started at `0` instead of `1`. Since a run of length *n* contains only *n − 1* adjacent equal pairs, every result came back one too small — `[1, 1]` returned 1, `[3, 3, 3]` returned 2 — and a single-element list returned 0 because the loop body never executed and `best` kept its initial value of `0`. […]

輸出 1094 tok 延遲 16.1 s

GLM-5 通過 · 8/8 cases

Here is the fixed code: ```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 best = max(best, cur) else: cur = 1 return best ``` **Explanation:** The bug stems from initializing `best` and `cur` to zero, which causes the function to count the number of *transitions* between adjacent elements rather than the total number of items in the run, resulting in a return value that is always one less than the actual length (reporting 0 for a single element and 1 for a pair). By initializing the counters to 1 and resetting `cur` to 1 when a streak breaks, the logic correctly counts the items themselves; adding an explicit check for an empty list ensures the function handles the zero-element edge case correctly.

輸出 2907 tok (+2694 思考) 延遲 73.7 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 Opus 5 通過 · 5/5 fields, guidance "Withheld pending Q4 close"

```json { "company": "Meridian Robotics", "quarter": "Q3", "revenue_usd_m": 412, "growth_pct": 11, "guidance": "Withheld pending Q4 close" } ``` Notes on judgment calls: - **quarter**: "September quarter" is labeled Q3 because the text refers to an upcoming "Q4 close," implying a calendar-aligned fiscal year. No fiscal year is given. - **revenue_usd_m**: 412 is stated as constant-currency and hedged ("call it"), so it's approximate; the currency is not explicitly stated as USD. - **growth_pct**: "up eleven and change" means slightly more than 11, so 11 is a floor rather than an exact figure.

輸出 539 tok 延遲 7.6 s

GLM-5 通過 · 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" } ```

輸出 3620 tok (+3561 思考) 延遲 91.8 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 Opus 5 通過 · 123 words, 0 banned, 1 question

**Cross-Provider Prompt Caching** We're introducing Cross-Provider Prompt Caching in the API Gateway. Repeated system prompts, long documents, and few-shot examples are stored once at the gateway layer and reused across OpenAI, Anthropic, Google, and self-hosted models. Instead of paying full input token costs on every request, your application sends a cache reference, and the gateway rehydrates the context before forwarding it downstream. Why does that matter? Teams running high-volume agents and retrieval pipelines typically see input token spend fall 40 to 70 percent, with median latency dropping by several hundred milliseconds. Caches are scoped per project, encrypted at rest, and invalidated automatically when a prompt template changes. Enable it with a single header, and see the docs for TTL tuning and per-route controls.

輸出 1593 tok 延遲 19.1 s

GLM-5 通過 · 119 words, 0 banned, 1 question

We are thrilled to introduce Global Prompt Caching, a powerful new capability within our API gateway designed to optimize your AI operations. By intelligently storing prompt responses across every supported provider, this feature drastically reduces latency and cuts operational costs. Instead of processing identical requests repeatedly, our system serves cached results instantly, ensuring consistent performance even during high-traffic periods. Why pay full price for repeated inference on the same inputs? This update gives developers fine-grained control over cache lifetimes and hit rates, allowing for predictable budgeting and faster application response times. You can activate this functionality directly in your dashboard settings today. Start maximizing your efficiency now and deliver a snappier experience to your end-users without unnecessary API expenditure.

輸出 715 tok (+571 思考) 延遲 18.9 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-opus-5",
    # model="glm-5",  # 取消註解此行,並註解上一行
    messages=[{"role": "user", "content": "Summarize this diff"}],
    reasoning_effort="medium",
)
print(resp.choices[0].message.content)

取得 API 金鑰 →

常見問題

Claude Opus 5 和 GLM-5 哪個比較便宜?

GLM-5 在 輸入 / 1m tokens 上較便宜($1 對比 $5,相差 5.0×)。其他項目可能呈現相反結果 — 上表提供完整資訊,實際成本取決於您的使用組合。

我可以在不進行兩次整合的情況下,對 Claude Opus 5 和 GLM-5 進行 A/B 測試嗎?

可以。兩者皆透過同一個相容 OpenAI 的端點提供服務,並使用同一把 API 金鑰 — 切換只需更改一行的模型字串,因此您可以將部分流量分別導向兩者並直接比較帳單。

Claude Opus 5 與 GLM-5 支援提示快取嗎?

是的 — 兩者的快取讀取費率皆低於其輸入費率,因此具有暖前綴的工作負載成本會低於牌價所示。確切的快取讀取列請見上方的定價表。

相關比較