VOOZH about

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

⇱ Can Qwen 3.5 9B Run on RTX 5070 Ti 16GB? YES (10.5/16.0GB)


Can Qwen 3.5 9B run on RTX 5070 Ti 16GB?

YES — Runs Great

S98Excellent
Estimated from fit model

Qwen 3.5 9B needs ~10.5 GB VRAM. RTX 5070 Ti 16GB has 16.0 GB. With Q4_K_M quantization, expect ~112 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: HighStack: BasicBottleneck: 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) — 10.5 GB, 112.3 tok/s, Runs well
10.5 GB required16.0 GB available
66% VRAM used

Fit status

Runs well

Decode

112.3 tok/s

TTFT

1724 ms

Safe context

56K

Memory

10.5 GB / 16.0 GB

Memory breakdown

Weights5.5 GB
KV Cache2.2 GB
Runtime1.2 GB
Headroom1.6 GB

See how fast it feels

See how fast it feelsQwen 3.5 9B on RTX 5070 Ti 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: 112.3 tok/s decode · 1.7s TTFT (warm) · 281 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 well112.3 tok/s940 ms56K
CodingSRuns well112.3 tok/s1724 ms56K
Agentic CodingSRuns well112.3 tok/s2508 ms56K
ReasoningSRuns well112.3 tok/s2038 ms56K
RAGSRuns well112.3 tok/s3135 ms56K

Quantization options

How Qwen 3.5 9B (9B params) fits at each quantization level on RTX 5070 Ti 16GB (16.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
3.5 GB
LowS89
Q3_K_S
3
4.4 GB
LowS90
NVFP4
4
5.0 GB
MediumS90
Q4_K_M
4
5.5 GB
MediumS91
Q5_K_M
5
6.5 GB
HighS92
Q6_K
6
7.4 GB
HighS93
Q8_0Best for your GPU
8
9.6 GB
Very HighS93
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 Ti 16GBSee all hardware for Qwen 3.5 9B