Can Codestral RAG 19B Pruned i1 run on RTX A5500 24GB?

YES — Runs Great

C54Usable

○Estimated from fit model

Codestral RAG 19B Pruned i1 needs ~17.4 GB VRAM. RTX A5500 24GB has 24.0 GB. With Q4_K_M quantization, expect ~52 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: MediumStack: 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) — 17.4 GB, 51.7 tok/s, Runs well

17.4 GB required24.0 GB available

73% VRAM used

Fit status

Runs well

Decode

51.7 tok/s

TTFT

3746 ms

Safe context

63K

Memory

17.4 GB / 24.0 GB

Memory breakdown

Weights11.6 GB

KV Cache2.2 GB

Runtime1.2 GB

Headroom2.4 GB

See how fast it feels

See how fast it feelsCodestral RAG 19B Pruned i1 on RTX A5500 24GB
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: 51.7 tok/s decode · 3.7s TTFT (warm) · 129 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	C	Runs well	51.7 tok/s	2043 ms	63K
Coding	C	Runs well	51.7 tok/s	3746 ms	63K
Agentic Coding	C	Runs well	51.7 tok/s	5448 ms	63K
Reasoning	C	Runs well	51.7 tok/s	4427 ms	63K
RAG	C	Runs well	51.7 tok/s	6810 ms	63K

Quantization options

How Codestral RAG 19B Pruned i1 (19B params) fits at each quantization level on RTX A5500 24GB (24.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	7.4 GB	Low	C47
Q3_K_S	3	9.3 GB	Low	C48
NVFP4	4

Get started

Copy-paste commands to run Codestral RAG 19B Pruned i1 on your machine.

Run

lms load hf-mradermacher--codestral-rag-19b-pruned-i1-gguf && lms server start

Frequently asked questions

See all results for RTX A5500 24GB See all hardware for Codestral RAG 19B Pruned i1

URL: https://willitrunai.com/can-run/hf-mradermacher--codestral-rag-19b-pruned-i1-gguf-on-rtx-a5500-24gb

⇱