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

GLM-5.3-Flash vs Kimi K3

vs

何时用哪一个

两者均接受文本、图像和视频输入并返回文本,且两者的上下文都在一百万 token 左右(glm-5.3-flash 为 1000000,kimi-k3 为 1048576),因此真正的区别在于价格和输出空间:glm-5.3-flash 的价格为输入 $0.15 和输出 $0.5,而后者分别为 $3 和 $15,输入便宜约 20x,输出便宜约 30x,缓存读取价格为 $0.03 对 $0.3。如果进行大批量的对话、代码和推理工作,或需要其显式的视觉标志,请选择 glm-5.3-flash。当你需要长度超过 163840 个 token 的单次回复时请选择 kimi-k3,因为它允许高达 1048576 的输出。

Benchmark 成绩

领先高于同侪均值无人分数更高GLM-5.3-Flash14 / 50 / 5Kimi K3451 / 6213 / 62

双方都被测过的 5 项。

GLM-5.3-Flash Kimi K3 其他被测模型 同侪均值 无人分数更高
Terminal-Bench 2.1
84.3%
88.3%
OSWorld-Verified
N/A
84.8%
Cybergym
N/A
80%
Finance Agent v2
N/A
54.4%
Harvey Lab-AA
N/A
无人分数更高 94.6%
Humanity's Last Exam with tools
55.3%
56%
Agents' Last Exam
26.3%
27.6%
Video-MME (w. sub)
N/A
无人分数更高 90%

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

定价

GLM-5.3-Flash Kimi K3 Δ
输入 / 1M tokens $0.15 $3 0.05×
输出 / 1M tokens $0.5 $15 0.033×
缓存读取 / 1M tokens $0.03 $0.3 0.1×

费率取自构建时的实时目录;每个模型页面均附有当前的费率卡。

它们的位置 — 以该计费单位计费的所有 67 个 聊天 模型的 每 1M token 的输入价格(对数刻度)

GLM-5.3-Flash · $0.15 Kimi K3 · $3
$0.05 · Qwen3 VL Flash $30 · GPT-5.4 Pro

能力

GLM-5.3-Flash Kimi K3
工具使用
思考控制 始终开启 始终开启
结构化输出
提示词缓存 隐式(自动) 隐式(自动)
缓存生存时间 未公开 未公开
最小缓存前缀 未公开 未公开

规格

GLM-5.3-Flash Kimi K3
输入模态 文本 图像 视频 文本 图像 视频
输出模态 文本 文本
上下文窗口 1M 1M
最大输出 164K 1M
思考参数 reasoning_effort reasoning_effort (top-level; the thinking object is not accepted)
允许的值
reasoning_effort
  • low
  • high
  • max
reasoning_effort
  • low
  • high
  • max
默认值 max max

规格转录自各供应商的文档;若供应商未发布某项数据,则直接省略该行,而非进行推断。 完整来源: GLM-5.3-Flash · Kimi K3

单个 Prompt,两个模型 —— 通过网关实测

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

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

Kimi K3 通过 · 3 sentences

Reasoning models don't just answer questions—they "think" first, generating long internal chains of step-by-step logic before producing a response. Those hidden thinking steps are billed as output tokens (the most expensive kind, typically 3–5x the price of input tokens), and a single query can generate thousands of them even when the visible answer is only a paragraph long. So you're paying for dramatically more compute per request: the bill doubled because the model does far more work behind the scenes, not because usage increased.

输出 755 tok (+637 思考) 延迟 20.8 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.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

Kimi K3 通过 · 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 a fencepost error: `cur` counts *matching adjacent pairs* rather than *items in the run*, because it starts at 0 and only increments when `xs[i] == xs[i - 1]`. A run of length L contains L−1 equal pairs, so every run was undercounted by exactly one. For a single-element list (a run of length 1) the loop never runs and the function returns 0 instead of 1; likewise any run ending at the last index — e.g. the two `2`s in `[1, 2, 2]` — reported 1 instead of 2, making it look like no run existed at all. […]

输出 1837 tok (+1547 思考) 延迟 47.2 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.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

Kimi K3 通过 · 5/5 fields, guidance null

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

输出 924 tok (+863 思考) 延迟 25.9 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.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

Kimi K3 通过 · 120 words, 0 banned, 1 question

Meet Prompt Cache, a new API gateway capability that stores prompt responses and serves them across OpenAI, Anthropic, Google, and Azure endpoints. It matches requests by model, prompt hash, tools, temperature, and tenant policy, so repeated work returns fast while sensitive contexts stay isolated. Teams set TTLs, stale rules, encryption scopes, and bypass flags per route. Analytics show hit rate, latency saved, token spend avoided, and drift risk by provider. What changes for developers? Keep one integration, add cache headers, and watch fallback logic respect consent, residency, and audit needs. During rollout, canary keys compare fresh answers with cached copies before promotion. Prompt Cache cuts vendor calls, steadies p95 latency, and gives platform owners controls for cost, quality, and compliance.

输出 1527 tok (+1354 思考) 延迟 37.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="glm-5.3-flash",
    # model="kimi-k3",  # 取消注释此行,注释上一行
    messages=[{"role": "user", "content": "Summarize this diff"}],
    reasoning_effort="medium",
)
print(resp.choices[0].message.content)

获取 API 密钥 →

常见问题

GLM-5.3-Flash 和 Kimi K3 哪个更便宜?

在 输入 / 1m tokens 方面,GLM-5.3-Flash 更便宜($0.15 对比 $3,相差 20×)。其他行可能得出相反的结论——上方表格提供了完整信息,实际成本取决于你的组合使用情况。

我可以在不进行两次集成的情况下,对 GLM-5.3-Flash 和 Kimi K3 进行 A/B 测试吗?

可以。两者均通过同一个兼容 OpenAI 的端点提供服务,并使用同一把 API 密钥——切换只需更改一行模型字符串,因此你可以将一部分流量路由到各个模型并直接比较账单。

GLM-5.3-Flash 和 Kimi K3 支持提示词缓存吗?

是的 —— 两者对缓存读取的计费均低于其输入费率,因此热前缀工作负载的成本低于标价。准确的缓存读取行位于上方的定价表中。

相关对比

来自我们的实测研究