MacBook Pro M4 Max 48GBBest value
48 GB Unified (+16)
B
This setup is broadly balanced for this model.37.4 tok/s decode
~$2,499 MSRP
Can Codestral 22B run on RTX 5000 Ada 32GB?
YES — Runs Great
B62Good
○Estimated from fit model
Codestral 22B needs ~20.3 GB VRAM. RTX 5000 Ada 32GB has 32.0 GB. With Q4_K_M quantization, expect ~34 tok/s.
Runtime: OllamaCapacity: RoomyBandwidth: MediumStack: 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.
Select quantization to explore
Q4_K_M (Medium quality) — 20.3 GB, 36.9 tok/s, Runs well
20.3 GB required32.0 GB available
63% VRAM used
Fit status
Runs well
Decode
36.9 tok/s
TTFT
5245 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 5000 Ada 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: 36.9 tok/s decode · 5.2s TTFT (warm) · 92 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 | 34.3 tok/s | 3075 ms | 33K |
| Coding | B | Runs well | 34.3 tok/s | 5638 ms | 33K |
| Agentic Coding | B | Runs well | 34.3 tok/s | 8201 ms | 33K |
| Reasoning | B | Runs well | 34.3 tok/s | 6663 ms | 33K |
| RAG | B | Runs well | 34.3 tok/s | 10251 ms | 33K |
Quantization options
How Codestral 22B (22B params) fits at each quantization level on RTX 5000 Ada 32GB (32.0 GB usable).
| Quant | Bits | VRAM | Quality | Fit |
|---|---|---|---|---|
Q2_K | 2 | 8.6 GB | Low | B55 |
Q3_K_S | 3 | 10.8 GB | Low | B56 |
NVFP4 | 4 |
Get started
Copy-paste commands to run Codestral 22B on your machine.
Run
ollama run codestralUpgrade options
