VOOZH about

URL: https://willitrunai.com/can-run/qwen-2.5-coder-32b-on-h200-141gb

⇱ Qwen 2.5 Coder 32B on NVIDIA H200 141GB? YES


Can Qwen 2.5 Coder 32B run on NVIDIA H200 141GB?

YES — Runs Great

A76Great
Estimated from fit model

Qwen 2.5 Coder 32B needs ~38.7 GB VRAM. NVIDIA H200 141GB has 141.0 GB. With Q4_K_M quantization, expect ~223 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) — 38.7 GB, 223.1 tok/s, Runs well
38.7 GB required141.0 GB available
27% VRAM used

Fit status

Runs well

Decode

223.1 tok/s

TTFT

868 ms

Safe context

131K

Memory

38.7 GB / 141.0 GB

Memory breakdown

Weights19.5 GB
KV Cache3.9 GB
Runtime1.2 GB
Headroom14.1 GB

See how fast it feels

See how fast it feelsQwen 2.5 Coder 32B 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: 223.1 tok/s decode · 868ms TTFT (warm) · 558 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 well223.1 tok/s473 ms131K
CodingARuns well223.1 tok/s868 ms131K
Agentic CodingARuns well223.1 tok/s1262 ms131K
ReasoningARuns well223.1 tok/s1026 ms131K
RAGARuns well223.1 tok/s1578 ms131K

Quantization options

How Qwen 2.5 Coder 32B (32B params) fits at each quantization level on NVIDIA H200 141GB (141.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
12.5 GB
LowB66
Q3_K_S
3
15.7 GB
LowB66
NVFP4
4
17.9 GB
MediumB66
Q4_K_M
4
19.5 GB
MediumB66
Q5_K_M
5
23.0 GB
HighB67
Q6_K
6
26.2 GB
HighB67
Q8_0
8
34.2 GB
Very HighB68
F16Best for your GPU
16
65.6 GB
MaximumA73

Get started

Copy-paste commands to run Qwen 2.5 Coder 32B on your machine.

Run

ollama run qwen2.5-coder

Your hardware

More models your NVIDIA H200 141GB can run

ModelParamsGradeDecodeCapabilities
👁 Mistral
Devstral 2 123B Instruct
123BS58.4 tok/s
👁 Alibaba
Qwen 3.5 122B A10B
122BS162.1 tok/s
👁 Alibaba
Qwen 3.6 35B A3B
35BS512.4 tok/s
👁 Alibaba
Qwen 3.5 35B A3B
35BS557.2 tok/s
👁 Mistral
Mistral Small 4 119B
119BS175.8 tok/s

Frequently asked questions

See all results for NVIDIA H200 141GBSee all hardware for Qwen 2.5 Coder 32B