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

Claude Opus 5 vs Qwen3.7 Plus

vs

何時該用哪一個 — 綜合評斷,而非基準測試數據表

兩者都提供 1000000 token 脈絡視窗,接受文字和影像輸入並輸出文字,所以差別主要在價格和形態:claude-opus-5 每百萬輸入 $5、輸出 $25,約為 qwen3.7-plus 的 $0.4 和 $1.6 的 12.5 倍和 15.6 倍,快取讀取 $0.5 對 $0.08。需要它明確的思考能力,或單次呼叫最多 128000 輸出 token 時選 claude-opus-5;大批量或長脈絡工作,或輸入包含 Opus 不接受的視訊時選 qwen3.7-plus。

定價

Claude Opus 5 Qwen3.7 Plus Δ
輸入 / 1M tokens $5 $0.4 13×
輸出 / 1M tokens $25 $1.6 16×
快取讀取 / 1M tokens $0.5 $0.08 6.3×
快取寫入 1.25x (5m) / 2x (1h) 1.25x

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

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

Claude Opus 5 · $5 Qwen3.7 Plus · $0.4
$0.05 · Qwen3 VL Flash $30 · GPT-5.4 Pro

能力

Claude Opus 5 Qwen3.7 Plus
工具使用
思考控制 可配置 可配置
結構化輸出
提示快取 顯式(由您標記前綴) 隱式 + 顯式
快取生命週期 5m default, 1h option explicit: 5m, reset on hit
最小快取前綴 1024 個 token 1024 個 token

規格

Claude Opus 5 Qwen3.7 Plus
輸入模態 文字 影像 文字 影像 影片
輸出模態 文字 文字
發布日期 2026-07-24 2026-06-01
知識截止日期 2026-05
上下文視窗 1M 1M
最大輸出 128K 66K
思考參數
  • thinking.type
  • output_config.effort
  • enable_thinking
  • thinking_budget
  • preserve_thinking
可接受的值
thinking.type
  • adaptive
  • disabled
effort
  • low
  • medium
  • high
  • xhigh
  • max
enable_thinking
  • true
  • false
thinking_budget
  • in tokens
preserve_thinking
  • true
  • false
預設值

thinking on

effort
  • high (Claude API and Claude Code)

on

the Qwen3.7 Plus series is hybrid thinking with thinking enabled by default, and preserve_thinking is off

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

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

提示詞 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

Qwen3.7 Plus 通過 · 3 sentences

Enabling reasoning requires the model to generate extensive internal "thinking" tokens to process complex logic before delivering a final answer. Because our vendor charges us per token consumed, this hidden computational overhead effectively doubles our output volume for the exact same number of user requests. Consequently, our costs have doubled because we are now paying for the model's increased processing time to achieve higher-quality, more accurate results.

輸出 1428 tok (+1345 思考) 延遲 25.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. 檢查 修復通過測試

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

Qwen3.7 Plus 通過 · 8/8 cases

## 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 else: cur = 1 best = max(best, cur) return best ``` ## Bug Explanation The function has two related bugs rooted in how it counts run lengths. First, `cur` is initialized to `0` and only incremented on matches, so it counts the number of *transitions* between equal elements rather than the total elements in the run—a run of N identical items only reaches `cur = N − 1`, undercounting by one. This also causes the single-element case to return `0`, since the loop never executes and `cur` never increments. […]

輸出 2317 tok (+2005 思考) 延遲 40.5 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

Qwen3.7 Plus 通過 · 5/5 fields, guidance null

{ "company": "Meridian Robotics", "quarter": "September", "revenue_usd_m": 412, "growth_pct": 11, "guidance": null }

輸出 1807 tok (+1750 思考) 延遲 31.6 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

Qwen3.7 Plus 通過 · 120 words, 0 banned, 1 question

Introducing PromptCache, our new API gateway feature designed to store and reuse prompts across multiple artificial intelligence providers. Have you ever noticed how repeatedly sending identical queries drains your budget and increases latency? PromptCache solves this by intelligently storing responses at the gateway level. When your application requests the same prompt from a different provider, the system instantly returns the cached result. This drastically reduces API costs and accelerates response times for your users. You can configure custom expiration times and set specific fallback rules for each vendor. You must stop paying twice for the exact same computation. Please upgrade your entire infrastructure today and experience much faster and cheaper integrations without changing a single line of your application code.

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

取得 API 金鑰 →

常見問題

Claude Opus 5 和 Qwen3.7 Plus 哪個比較便宜?

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

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

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

Claude Opus 5 與 Qwen3.7 Plus 支援提示快取嗎?

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

相關比較