VOOZH about

URL: https://willitrunai.com/can-run/codestral-22b-on-rtx-5090-32gb


Can Codestral 22B run on RTX 5090 32GB?

YES — Runs Great

B65Good
Estimated from fit model

Codestral 22B needs ~20.3 GB VRAM. RTX 5090 32GB has 32.0 GB. With Q4_K_M quantization, expect ~90 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) — 20.3 GB, 96.2 tok/s, Runs well
20.3 GB required32.0 GB available
63% VRAM used

Fit status

Runs well

Decode

96.2 tok/s

TTFT

2013 ms

Safe context

33K

Memory

20.3 GB / 32.0 GB

Memory breakdown

Weights13.4 GB
KV Cache2.4 GB
Runtime1.2 GB
Headroom3.2 GB

See how fast it feels

See how fast it feelsCodestral 22B on RTX 5090 32GB
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: 96.2 tok/s decode · 2.0s TTFT (warm) · 240 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 well89.5 tok/s1180 ms33K
CodingBRuns well89.5 tok/s2164 ms33K
Agentic CodingBRuns well89.5 tok/s3148 ms33K
ReasoningBRuns well89.5 tok/s2557 ms33K
RAGBRuns well89.5 tok/s3934 ms33K

Quantization options

How Codestral 22B (22B params) fits at each quantization level on RTX 5090 32GB (32.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
8.6 GB
LowB55
Q3_K_S
3
10.8 GB
LowB56
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 RTX 5090 32GBSee all hardware for Codestral 22B
12.3 GB
Medium
B57
Q4_K_M
4
13.4 GB
MediumB58
Q5_K_M
5
15.8 GB
HighB59
Q6_K
6
18.0 GB
HighB59
Q8_0Best for your GPU
8
23.5 GB
Very HighB59
F16
16
45.1 GB
MaximumF0