VOOZH about

URL: https://willitrunai.com/can-run/qwen-3.5-9b-on-rtx-5070-12gb

⇱ Can Qwen 3.5 9B Run on RTX 5070 12GB? YES (9.8/12.0GB)


Can Qwen 3.5 9B run on RTX 5070 12GB?

YES — Runs Great

S98Excellent
Estimated from fit model

Qwen 3.5 9B needs ~9.8 GB VRAM. RTX 5070 12GB has 12.0 GB. With Q4_K_M quantization, expect ~83 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: MediumStack: 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) — 9.8 GB, 82.9 tok/s, Runs well
9.8 GB required12.0 GB available
82% VRAM used

Fit status

Runs well

Decode

82.9 tok/s

TTFT

2335 ms

Safe context

32K

Memory

9.8 GB / 12.0 GB

Memory breakdown

Weights5.5 GB
KV Cache2.2 GB
Runtime0.9 GB
Headroom1.2 GB

See how fast it feels

See how fast it feelsQwen 3.5 9B on RTX 5070 12GB
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: 82.9 tok/s decode · 2.3s TTFT (warm) · 207 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
ChatSRuns well82.9 tok/s1274 ms32K
CodingSRuns well82.9 tok/s2335 ms32K
Agentic CodingSRuns with offload82.9 tok/s3397 ms32K
ReasoningSRuns well82.9 tok/s2760 ms32K
RAGSRuns with offload82.9 tok/s4246 ms32K

Quantization options

How Qwen 3.5 9B (9B params) fits at each quantization level on RTX 5070 12GB (12.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
3.5 GB
LowS92
Q3_K_S
3
4.4 GB
LowS93
NVFP4
4
5.0 GB
MediumS94
Q4_K_M
4
5.5 GB
MediumS94
Q5_K_M
5
6.5 GB
HighS94
Q6_KBest for your GPU
6
7.4 GB
HighS93
Q8_0
8
9.6 GB
Very HighF0
F16
16
18.5 GB
MaximumF0

Get started

Copy-paste commands to run Qwen 3.5 9B on your machine.

Run

ollama run qwen3.5:9b

Frequently asked questions

See all results for RTX 5070 12GBSee all hardware for Qwen 3.5 9B