VOOZH about

URL: https://willitrunai.com/can-run/qwen-2.5-coder-14b-on-rx-7900-xt-20gb


Can Qwen 2.5 Coder 14B run on RX 7900 XT 20GB?

YES — Runs Great

B70Good
Estimated from fit model

Qwen 2.5 Coder 14B needs ~14.4 GB VRAM. RX 7900 XT 20GB has 20.0 GB. With Q4_K_M quantization, expect ~56 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: HighStack: StandardBottleneck: 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) — 14.4 GB, 60.7 tok/s, Runs well
14.4 GB required20.0 GB available
72% VRAM used

Fit status

Runs well

Decode

60.7 tok/s

TTFT

3189 ms

Safe context

47K

Memory

14.4 GB / 20.0 GB

Memory breakdown

Weights8.5 GB
KV Cache2.9 GB
Runtime0.9 GB
Headroom2.0 GB

See how fast it feels

See how fast it feelsQwen 2.5 Coder 14B 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: 60.7 tok/s decode · 3.2s TTFT (warm) · 152 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 well60.7 tok/s1740 ms47K
CodingBRuns well56.2 tok/s3444 ms47K
Agentic CodingBTight fit60.7 tok/s4639 ms47K
ReasoningBRuns well60.7 tok/s3769 ms47K
RAGBTight fit60.7 tok/s5799 ms47K

Quantization options

How Qwen 2.5 Coder 14B (14B params) fits at each quantization level on RX 7900 XT 20GB (20.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
5.5 GB
LowB61
Q3_K_S
3
6.9 GB
LowB63
NVFP4
4

Get started

Copy-paste commands to run Qwen 2.5 Coder 14B on your machine.

Run

ollama run qwen2.5-coder:14b

Frequently asked questions

See all results for RX 7900 XT 20GBSee all hardware for Qwen 2.5 Coder 14B
7.8 GB
Medium
B63
Q4_K_M
4
8.5 GB
MediumB64
Q5_K_M
5
10.1 GB
HighB65
Q6_K
6
11.5 GB
HighB65
Q8_0Best for your GPU
8
15.0 GB
Very HighB64
F16
16
28.7 GB
MaximumF0