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

GLM-5 vs Kimi K2.7 Code

vs

什么时候选哪个

任务是纯文本且回复很长时选 glm-5:单次最多输出 131072 token,是 kimi-k2.7-code 的 32768 上限的 4 倍,输出 $3.2 对 $4 便宜约 1.3 倍,想要直接答案时可关闭思考。需要图像或视频输入(glm-5 不接受)时选 kimi-k2.7-code;输入 $0.95 对 $1 基本持平,缓存读取 $0.19 对 $0.2 也持平,窗口略大,256000 token 对 200000。代价是无法关闭的推理。

Benchmark 成绩

高于同类均值无更高分GLM-515 / 522 / 52Kimi K2.7 Code1 / 50 / 5
GLM-5 Kimi K2.7 Code 其他参测模型 同类均值 ★ 没有模型得分更高
SWE-Bench Pro
55.1%
N/A
Cybergym
43.2%
N/A
SkillsBench Avg@5
没有模型得分更高 47.2%
N/A
GPQA Diamond
86%
N/A
MCP-Atlas
69.8%
76%

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

价格

GLM-5 Kimi K2.7 Code Δ
输入 / 1M token $1 $0.95 1.1×
输出 / 1M token $3.2 $4 0.8×
缓存读取 / 1M token $0.2 $0.19 1.1×

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

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

GLM-5 · $1 Kimi K2.7 Code · $0.95
$0.05 · Qwen3 VL Flash $30 · GPT-5.4 Pro

能力

GLM-5 Kimi K2.7 Code
工具调用 是 是
思考控制 可配置 始终开启
结构化输出 是 -
提示词缓存 隐式(自动) 隐式(自动)
缓存有效期 未公布 未公布
最小缓存前缀 未公布 未公布

规格

GLM-5 Kimi K2.7 Code
输入模态 文本 文本 图像 视频
输出模态 文本 文本
发布日期 2026-02-12 2026-06
上下文窗口 200K 256K
最大输出 131K 33K
思考参数 thinking.type
  • thinking.type
  • thinking.keep
可选值
thinking.type
  • enabled
  • disabled
type
  • accepts only enabled
keep
  • accepts only all
默认值 enabled, and on GLM-5 the model automatically determines whether to think thinking on with Preserved Thinking on

规格照录自各供应商的文档;供应商没有公布的项目,对应的行直接省略,不做推断。 完整来源: GLM-5 · Kimi K2.7 Code

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

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

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

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

指令遵循(恰好三句,数得出来)、受众适配(对 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. 检查 修复通过测试

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

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

修复是否真的正确(能运行)、解释的信息密度,以及在一个范围明确的任务上的 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

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

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

是否严守 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 个禁用词

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

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

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

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

下方每个标签页里都有两个模型 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="glm-5",
    # model="kimi-k2.7-code",  # 取消注释此行,注释上一行
    messages=[{"role": "user", "content": "Summarize this diff"}],
    reasoning_effort="medium",
)
print(resp.choices[0].message.content)

获取 API key →

常见问题

GLM-5 和 Kimi K2.7 Code 哪个更便宜?

按「输入 / 1M token」算,Kimi K2.7 Code 更便宜($0.95 对 $1,相差 1.1×)。其他计费项的结论可能相反,完整价格见上方表格,实际成本取决于你的用量构成。

不用分别集成两次,就能对 GLM-5 和 Kimi K2.7 Code 做 A/B 测试吗?

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

GLM-5 和 Kimi K2.7 Code 支持提示词缓存吗?

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

相关对比

我们的实测研究