Can Codestral 22B v0.1 i1 run on RX 7900 XT 20GB?

YES — Tight Fit

C50Usable

○Estimated from fit model

Codestral 22B v0.1 i1 needs ~18.9 GB VRAM. RX 7900 XT 20GB has 20.0 GB. With Q4_K_M quantization, expect ~36 tok/s.

Runtime: llama.cppCapacity: TightBandwidth: HighStack: StandardBottleneck: 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) — 18.9 GB, 35.8 tok/s, Tight fit

18.9 GB required20.0 GB available

95% VRAM used

Fit status

Tight fit

Decode

35.8 tok/s

TTFT

5413 ms

Safe context

23K

Memory

18.9 GB / 20.0 GB

Memory breakdown

Weights13.4 GB

KV Cache2.6 GB

Runtime0.9 GB

Headroom2.0 GB

See how fast it feels

See how fast it feelsCodestral 22B v0.1 i1 on RX 7900 XT 20GB
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: 35.8 tok/s decode · 5.4s TTFT (warm) · 89 tok/s prefill

What limits this setup

This setup is broadly balanced for this model.

Very little memory headroom

You can run the model, but there is not much room left for longer context, bigger batches, extra apps, or future model updates.

Best improvement path

Buy headroom, not only minimum fit

A slightly larger memory tier gives you safer context growth and makes the recommendation more future-proof.

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	C	Tight fit	35.8 tok/s	2952 ms	23K
Coding	C	Tight fit	35.8 tok/s	5413 ms	23K
Agentic Coding	D	Runs with offload (needs ~0.9 GB host RAM)	23.1 tok/s	12195 ms	23K
Reasoning	C	Tight fit	35.8 tok/s	6397 ms	23K
RAG	D	Runs with offload (needs ~0.9 GB host RAM)	23.1 tok/s	15244 ms