Can Qwen3-Coder 480B A35B Instruct run on NVIDIA H200 PCIe 141GB?

NO — Won't Fit

F0Won't run

○Estimated from fit model

Qwen3-Coder 480B A35B Instruct needs ~310.7 GB but NVIDIA H200 PCIe 141GB only has 141.0 GB. Try a smaller quantization or lighter model.

Runtime: llama.cppCapacity: No fitBandwidth: HighStack: StandardBottleneck: Memory capacity

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) — 310.7 GB, exceeds 141.0 GB available

310.7 GB required141.0 GB available

220% VRAM needed

169.7 GB over capacity — needs offload or smaller quantization

Fit status

Too heavy

Decode

6.4 tok/s

TTFT

30179 ms

Safe context

Memory

310.7 GB / 141.0 GB

Offload

50%

Memory breakdown

Weights292.8 GB

KV Cache2.9 GB

Runtime0.9 GB

Headroom14.1 GB

See how fast it feels

With memory offload — actual speed may be lower

See how fast it feelsQwen3-Coder 480B A35B Instruct on NVIDIA H200 PCIe 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: 6.4 tok/s decode · 30.2s TTFT (warm) · 16 tok/s prefill

What limits this setup

Usable VRAM is the main blocker for this model.

Not enough usable memory

The model needs 310.7 GB, but this setup only exposes 141.0 GB of usable VRAM.

Best improvement path

Add more VRAM headroom

The first useful upgrade is more dedicated VRAM so you can fit the model without shrinking context or dropping to a much lower quant.

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	F	Too heavy	6.5 tok/s	16307 ms	4K
Coding	F	Too heavy	5.9 tok/s	33009 ms	4K
Agentic Coding	F	Too heavy	6.3 tok/s	44664 ms	4K
Reasoning	F	Too heavy	6.4 tok/s	35667 ms	4K
RAG	F	Too heavy	6.3 tok/s	55830 ms	4K