Can Qwen 3.5 9B run on MacBook Pro M3 Pro 18GB?

YES — Runs Great

S94Excellent

○Estimated from fit model

Qwen 3.5 9B needs ~10.5 GB VRAM. MacBook Pro M3 Pro 18GB has 13.0 GB. With Q4_K_M quantization, expect ~20 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: Very lowStack: StandardBottleneck: Memory bandwidth

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, 21.4 tok/s, Runs well

10.5 GB required13.0 GB available

81% VRAM used

Fit status

Runs well

Decode

21.4 tok/s

TTFT

9029 ms

Safe context

34K

Memory

10.5 GB / 13.0 GB

Memory breakdown

Weights5.5 GB

KV Cache2.2 GB

Runtime0.9 GB

Headroom1.9 GB

See how fast it feels

See how fast it feelsQwen 3.5 9B on MacBook Pro M3 Pro 18GB
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: 21.4 tok/s decode · 9.0s TTFT (warm) · 54 tok/s prefill

What limits this setup

This setup is broadly balanced for this model.

Shared-memory contention still exists

The OS, browser, and inference runtime all compete for the same physical memory pool, so real-world headroom is less forgiving than raw capacity suggests.

Best improvement path

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	S	Runs well	21.4 tok/s	4925 ms	34K
Coding	S	Runs well	19.9 tok/s	9707 ms	34K
Agentic Coding	S	Runs with offload	19.9 tok/s	14119 ms	34K
Reasoning	S	Runs well	21.4 tok/s	10671 ms	34K
RAG	S	Runs with offload	19.9 tok/s	17648 ms	34K

Quantization options

How Qwen 3.5 9B (9B params) fits at each quantization level on MacBook Pro M3 Pro 18GB (13.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	3.5 GB	Low	S91
Q3_K_S	3	4.4 GB	Low	S92
NVFP4	4

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 MacBook Pro M3 Pro 18GB See all hardware for Qwen 3.5 9B

URL: https://willitrunai.com/can-run/qwen-3.5-9b-on-m3-pro-18gb

⇱