VOOZH about

URL: https://willitrunai.com/can-run/qwen-2.5-coder-32b-on-instinct-mi325x-256gb

⇱ Qwen 2.5 Coder 32B on AMD Instinct MI325X 256GB? YES


Can Qwen 2.5 Coder 32B run on AMD Instinct MI325X 256GB?

YES — Runs Great

A74Great
Estimated from fit model

Qwen 2.5 Coder 32B needs ~49.9 GB VRAM. AMD Instinct MI325X 256GB has 256.0 GB. With Q4_K_M quantization, expect ~242 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) — 49.9 GB, 242.3 tok/s, Runs well
49.9 GB required256.0 GB available
19% VRAM used

Fit status

Runs well

Decode

242.3 tok/s

TTFT

799 ms

Safe context

131K

Memory

49.9 GB / 256.0 GB

Memory breakdown

Weights19.5 GB
KV Cache3.9 GB
Runtime0.9 GB
Headroom25.6 GB

See how fast it feels

See how fast it feelsQwen 2.5 Coder 32B on AMD Instinct MI325X 256GB
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: 242.3 tok/s decode · 799ms TTFT (warm) · 606 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
ChatARuns well242.3 tok/s436 ms131K
CodingARuns well242.3 tok/s799 ms131K
Agentic CodingARuns well242.3 tok/s1162 ms131K
ReasoningARuns well242.3 tok/s944 ms131K
RAGARuns well242.3 tok/s1453 ms131K

Quantization options

How Qwen 2.5 Coder 32B (32B params) fits at each quantization level on AMD Instinct MI325X 256GB (256.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
12.5 GB
LowB64
Q3_K_S
3
15.7 GB
LowB64
NVFP4
4
17.9 GB
MediumB64
Q4_K_M
4
19.5 GB
MediumB65
Q5_K_M
5
23.0 GB
HighB65
Q6_K
6
26.2 GB
HighB65
Q8_0
8
34.2 GB
Very HighB66
F16Best for your GPU
16
65.6 GB
MaximumB68

Get started

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

Run

ollama run qwen2.5-coder

Your hardware

More models your AMD Instinct MI325X 256GB can run

ModelParamsGradeDecodeCapabilities
👁 Alibaba
Qwen 3.5 397B A17B
397BA39.2 tok/s
👁 Mistral
Devstral 2 123B Instruct
123BS63.5 tok/s
👁 Alibaba
Qwen 3.5 122B A10B
122BS176.1 tok/s
👁 DeepSeek
DeepSeek V4 Flash
284BS94.4 tok/s
👁 Alibaba
Qwen 3.6 35B A3B
35BS556.6 tok/s

Frequently asked questions

See all results for AMD Instinct MI325X 256GBSee all hardware for Qwen 2.5 Coder 32B