Can Codestral 22B v0.1 run on NVIDIA H200 PCIe 141GB?

YES — Runs Great

C46Usable

○Estimated from fit model

Codestral 22B v0.1 needs ~31.3 GB VRAM. NVIDIA H200 PCIe 141GB has 141.0 GB. With Q4_K_M quantization, expect ~300 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: HighStack: BasicBottleneck: Balanced

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) — 31.3 GB, 300.4 tok/s, Runs well

31.3 GB required141.0 GB available

22% VRAM used

Fit status

Runs well

Decode

300.4 tok/s

TTFT

644 ms

Safe context

697K

Memory

31.3 GB / 141.0 GB

Memory breakdown

Weights13.4 GB

KV Cache2.6 GB

Runtime1.2 GB

Headroom14.1 GB

See how fast it feels

See how fast it feelsCodestral 22B v0.1 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: 300.4 tok/s decode · 644ms TTFT (warm) · 751 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

Workload	Grade	Fit	Decode	TTFT	Context
Chat	C	Runs well	300.4 tok/s	351 ms	697K
Coding	C	Runs well	300.4 tok/s	644 ms	697K
Agentic Coding	C	Runs well	300.4 tok/s	937 ms	697K
Reasoning	C	Runs well	300.4 tok/s	762 ms	697K
RAG	C	Runs well	300.4 tok/s	1172 ms	697K

Quantization options

How Codestral 22B v0.1 (22B params) fits at each quantization level on NVIDIA H200 PCIe 141GB (141.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	8.6 GB	Low	D38
Q3_K_S	3	10.8 GB	Low	D38
NVFP4	4

Get started

Copy-paste commands to run Codestral 22B v0.1 on your machine.

Run

lms load hf-sanctumai--codestral-22b-v0-1-gguf && lms server start

Frequently asked questions

See all results for NVIDIA H200 PCIe 141GB See all hardware for Codestral 22B v0.1

URL: https://willitrunai.com/can-run/hf-sanctumai--codestral-22b-v0-1-gguf-on-h200-pcie-141gb

⇱