Can Codestral 22B run on RTX 6000 Ada 48GB?

YES — Runs Great

B60Good

○Estimated from fit model

Codestral 22B needs ~21.9 GB VRAM. RTX 6000 Ada 48GB has 48.0 GB. With Q4_K_M quantization, expect ~59 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) — 21.9 GB, 63.1 tok/s, Runs well

21.9 GB required48.0 GB available

46% VRAM used

Fit status

Runs well

Decode

63.1 tok/s

TTFT

3070 ms

Safe context

33K

Memory

21.9 GB / 48.0 GB

Memory breakdown

Weights13.4 GB

KV Cache2.4 GB

Runtime1.2 GB

Headroom4.8 GB

See how fast it feels

See how fast it feelsCodestral 22B on RTX 6000 Ada 48GB
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: 63.1 tok/s decode · 3.1s TTFT (warm) · 158 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	B	Runs well	63.1 tok/s	1675 ms	33K
Coding	B	Runs well	58.7 tok/s	3300 ms	33K
Agentic Coding	B	Runs well	63.1 tok/s	4466 ms	33K
Reasoning	B	Runs well	63.1 tok/s	3628 ms	33K
RAG	B	Runs well	63.1 tok/s	5582 ms	33K

Quantization options

How Codestral 22B (22B params) fits at each quantization level on RTX 6000 Ada 48GB (48.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	8.6 GB	Low	C53
Q3_K_S	3	10.8 GB	Low	C53
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 6000 Ada 48GB See all hardware for Codestral 22B

URL: https://willitrunai.com/can-run/codestral-22b-on-rtx-6000-ada-48gb

⇱