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

Kimi K2.7 Code vs Qwen3.7 Plus

vs

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

兩者都接受文字、影像和視訊輸入並回傳文字,都涵蓋對話、程式碼、推理和工具,所以差別在價格和餘量:qwen3.7-plus 輸入 $0.4、輸出 $1.6,對比 kimi-k2.7-code 的 $0.95 和 $4,輸入便宜約 2.4 倍、輸出便宜約 2.5 倍,脈絡 1000000 token、最大輸出 65536,並帶長脈絡標誌。整倉或長文件執行、更便宜的快取讀取($0.08 對 $0.19),以及需要關閉思考時選 qwen3.7-plus。想要它常開的推理且 256000 token 夠用時選 kimi-k2.7-code。

定價

Kimi K2.7 Code Qwen3.7 Plus Δ
輸入 / 1M tokens $0.95 $0.4 2.4×
輸出 / 1M tokens $4 $1.6 2.5×
快取讀取 / 1M tokens $0.19 $0.08 2.4×
快取寫入 1.25x

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

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

Kimi K2.7 Code · $0.95 Qwen3.7 Plus · $0.4
$0.05 · Qwen3 VL Flash $30 · GPT-5.4 Pro

能力

Kimi K2.7 Code Qwen3.7 Plus
工具使用
思考控制 常駐開啟 可配置
結構化輸出
提示快取 隱式(自動) 隱式 + 顯式
快取生命週期 未公開 explicit: 5m, reset on hit
最小快取前綴 未公開 1024 個 token

規格

Kimi K2.7 Code Qwen3.7 Plus
輸入模態 文字 影像 影片 文字 影像 影片
輸出模態 文字 文字
發布日期 2026-06 2026-06-01
上下文視窗 256K 1M
最大輸出 33K 66K
思考參數
  • thinking.type
  • thinking.keep
  • enable_thinking
  • thinking_budget
  • preserve_thinking
可接受的值
type
  • accepts only enabled
keep
  • accepts only all
enable_thinking
  • true
  • false
thinking_budget
  • in tokens
preserve_thinking
  • true
  • false
預設值 thinking on with Preserved Thinking on

on

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

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

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

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

Kimi K2.7 Code 通過 · 3 sentences

Enabling reasoning mode causes the model to generate an internal chain-of-thought before producing each answer, and that hidden reasoning text is billed like any other output. Those extra reasoning tokens typically add up to much more than the final response itself, so every API call now costs significantly more than before. Because our overall usage volume did not change, the doubled bill reflects that each query consumes roughly twice as many billable tokens.

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

Kimi K2.7 Code 通過 · 8/8 cases

```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 ``` The bug is that the function counts *transitions* between equal neighbors instead of counting the items themselves, so a single-element list never enters the loop and returns `0` instead of `1`. Likewise, resetting `cur` to `0` on a mismatch forgets the current item that starts a new run, which causes runs that end at the last index to be undercounted. Initializing both `best` and `cur` to `1` and resetting `cur` to `1` fixes both issues.

輸出 410 tok (+222 思考) 延遲 9.4 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 精確

Kimi K2.7 Code 通過 · 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" } ```

輸出 721 tok (+663 思考) 延遲 13.2 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 個禁用詞

Kimi K2.7 Code 通過 · 120 words, 0 banned, 1 question

We're introducing Prompt Cache for our API Gateway, a new capability that stores prompt responses across multiple AI providers. By caching replies, you reduce redundant calls, lower latency, and cut costs without changing how you build. Teams using several model providers can now reuse identical prompt results instantly, keeping traffic consistent and budgets predictable. Responses are keyed by provider, model, and exact prompt, so you always get the right result. Configure TTL, hit thresholds, and eviction rules from a single dashboard. It fits into your existing routing and requires no code changes. Setup takes minutes and works with your current endpoints. Want to see how much latency and spend you can trim? Check the docs to enable Prompt Cache today.

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

取得 API 金鑰 →

常見問題

Kimi K2.7 Code 和 Qwen3.7 Plus 哪個比較便宜?

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

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

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

Kimi K2.7 Code 與 Qwen3.7 Plus 支援提示快取嗎?

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

相關比較