VOOZH about

URL: https://willitrunai.com/can-run/codestral-22b-on-h200-141gb


Can Codestral 22B run on NVIDIA H200 141GB?

YES — Runs Great

B57Good
Estimated from fit model

Codestral 22B needs ~31.2 GB VRAM. NVIDIA H200 141GB has 141.0 GB. With Q4_K_M quantization, expect ~300 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) — 31.2 GB, 308.0 tok/s, Runs well
31.2 GB required141.0 GB available
22% VRAM used

Fit status

Runs well

Decode

308.0 tok/s

TTFT

629 ms

Safe context

33K

Memory

31.2 GB / 141.0 GB

Memory breakdown

Weights13.4 GB
KV Cache2.4 GB
Runtime1.2 GB
Headroom14.1 GB

See how fast it feels

See how fast it feelsCodestral 22B 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: 308.0 tok/s decode · 629ms TTFT (warm) · 770 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
ChatBRuns well300.4 tok/s351 ms33K
CodingBRuns well300.4 tok/s644 ms33K
Agentic CodingBRuns well300.4 tok/s937 ms33K
ReasoningBRuns well300.4 tok/s762 ms33K
RAGBRuns well300.4 tok/s1172 ms33K

Quantization options

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

QuantBitsVRAMQualityFit
Q2_K
2
8.6 GB
LowC48
Q3_K_S
3
10.8 GB
LowC48
NVFP4
4

Get started

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

Run

ollama run codestral

Frequently asked questions

See all results for NVIDIA H200 141GBSee all hardware for Codestral 22B
12.3 GB
Medium
C48
Q4_K_M
4
13.4 GB
MediumC48
Q5_K_M
5
15.8 GB
HighC48
Q6_K
6
18.0 GB
HighC49
Q8_0
8
23.5 GB
Very HighC49
F16Best for your GPU
16
45.1 GB
MaximumC52