Can Qwen 2.5 Coder 14B run on RX 7800 XT 16GB?

YES — Tight Fit

B66Good

○Estimated from fit model

Qwen 2.5 Coder 14B needs ~14.0 GB VRAM. RX 7800 XT 16GB has 16.0 GB. With Q4_K_M quantization, expect ~49 tok/s.

Runtime: llama.cppCapacity: TightBandwidth: MediumStack: 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) — 14.0 GB, 48.9 tok/s, Tight fit

14.0 GB required16.0 GB available

88% VRAM used

Fit status

Tight fit

Decode

48.9 tok/s

TTFT

3957 ms

Safe context

27K

Memory

14.0 GB / 16.0 GB

Memory breakdown

Weights8.5 GB

KV Cache2.9 GB

Runtime0.9 GB

Headroom1.6 GB

See how fast it feels

See how fast it feelsQwen 2.5 Coder 14B on RX 7800 XT 16GB
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: 48.9 tok/s decode · 4.0s TTFT (warm) · 122 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	48.9 tok/s	2158 ms	27K
Coding	B	Tight fit	48.9 tok/s	3957 ms	27K
Agentic Coding	C	Runs with offload (needs ~0.5 GB host RAM)	32.7 tok/s	8610 ms	27K
Reasoning	B	Tight fit	48.9 tok/s	4676 ms	27K
RAG	C	Runs with offload (needs ~0.5 GB host RAM)	32.7 tok/s	10763 ms