VOOZH about

URL: https://willitrunai.com/can-run/codegeex-4-9b-on-h200-141gb


Can CodeGeeX 4 9B run on NVIDIA H200 141GB?

YES — Runs Great

A73Great
Estimated from fit model

CodeGeeX 4 9B needs ~21.4 GB VRAM. NVIDIA H200 141GB has 141.0 GB. With Q4_K_M quantization, expect ~126 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: HighStack: BasicBottleneck: Balanced
Share:

Operating mode

Choose the run profile you care about

Interactive favors responsiveness, while light API and scale-out lean harder on serving readiness. The fit stays the same, but the recommendation lens changes.

Current mode

Balanced

Balanced for general local use. Keeps the ranking neutral across personal and serving workflows.

Capabilities:

Select quantization to explore

Q4_K_M (Medium quality) — 21.4 GB, 126.0 tok/s, Runs well
21.4 GB required141.0 GB available
15% VRAM used

Fit status

Runs well

Decode

126.0 tok/s

TTFT

1537 ms

Safe context

131K

Memory

21.4 GB / 141.0 GB

Memory breakdown

Weights5.5 GB
KV Cache0.6 GB
Runtime1.2 GB
Headroom14.1 GB

See how fast it feels

See how fast it feelsCodeGeeX 4 9B on NVIDIA H200 141GB
1st promptCold start — includes initialization
>Write a Python function to sort a list
Here's a Python function that sorts a list using quicksort: def quicksort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quicksort(left) + middle + quicksort(right) # Example usage numbers = [3, 6, 8, 10, 1, 2, 1] print(quicksort(numbers)) # [1, 1, 2, 3, 6, 8, 10] The algorithm picks a pivot, partitions the list into smaller, equal, and larger elements, then recursively sorts each partition and concatenates the results.
2nd promptWarm — model ready, no init overhead
>Now add type hints and a docstring
def quicksort(arr: list[int]) -> list[int]: """Sort a list using the quicksort algorithm. Args: arr: List of integers to sort. Returns: A new sorted list. """ if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quicksort(left) + middle + quicksort(right) Added type hints for the input and return type, plus a Google-style docstring.
Estimated: 126.0 tok/s decode · 1.5s TTFT (warm) · 315 tok/s prefill

What limits this setup

This setup is broadly balanced for this model.

No major red flags

This recommendation has enough memory headroom and acceptable estimated speed for the selected workload.

Best improvement path

Performance by workload

WorkloadGradeFitDecodeTTFTContext
ChatARuns well126.0 tok/s838 ms131K
CodingARuns well126.0 tok/s1537 ms131K
Agentic CodingARuns well126.0 tok/s2235 ms131K
ReasoningARuns well126.0 tok/s1816 ms131K
RAGARuns well126.0 tok/s2794 ms131K

Quantization options

How CodeGeeX 4 9B (9B params) fits at each quantization level on NVIDIA H200 141GB (141.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
3.5 GB
LowB66
Q3_K_S
3
4.4 GB
LowB66
NVFP4
4

Get started

Copy-paste commands to run CodeGeeX 4 9B on your machine.

Run

docker run --rm -it ghcr.io/ggerganov/llama.cpp:full \ --hf-repo "THUDM/codegeex4-all-9b" \ --hf-file "codegeex4-all-9b-Q4_K_M.gguf" \ -c 4096 -ngl 99

Your hardware

More models your NVIDIA H200 141GB can run

ModelParamsGradeDecodeCapabilities
👁 Mistral
Devstral 2 123B Instruct
123BS58.4 tok/s
👁 Alibaba
Qwen3-Coder 30B A3B Instruct
30.5BS

Frequently asked questions

See all results for NVIDIA H200 141GBSee all hardware for CodeGeeX 4 9B
5.0 GB
Medium
B66
Q4_K_M
4
5.5 GB
MediumB66
Q5_K_M
5
6.5 GB
HighB66
Q6_K
6
7.4 GB
HighB66
Q8_0
8
9.6 GB
Very HighB66
F16Best for your GPU
16
18.5 GB
MaximumB66
609.7 tok/s
👁 Alibaba
Qwen 3.5 27B
27BS264.4 tok/s
👁 Alibaba
Qwen 3.6 27B
27BS265.2 tok/s
👁 Alibaba
Qwen 3.5 122B A10B
122BS162.1 tok/s