VOOZH about

URL: https://willitrunai.com/can-run/qwen-3.5-9b-on-m4-32gb

⇱ Qwen 3.5 9B on MacBook Pro M4 32GB? YES


Can Qwen 3.5 9B run on MacBook Pro M4 32GB?

YES — Runs Great

S89Excellent
Estimated — low-sample bucket· few comparable runs

Qwen 3.5 9B needs ~12.0 GB VRAM. MacBook Pro M4 32GB has 23.0 GB. With Q4_K_M quantization, expect ~16 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: Very lowStack: StandardBottleneck: Memory bandwidth
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) — 12.0 GB, 15.6 tok/s, Runs well
12.0 GB required23.0 GB available
52% VRAM used

Fit status

Runs well

Decode

15.6 tok/s

TTFT

12438 ms

Safe context

96K

Memory

12.0 GB / 23.0 GB

Memory breakdown

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

See how fast it feels

See how fast it feelsQwen 3.5 9B on MacBook Pro M4 32GB
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: 15.6 tok/s decode · 12.4s TTFT (warm) · 39 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

WorkloadGradeFitDecodeTTFTContext
ChatSRuns well15.6 tok/s6785 ms96K
CodingSRuns well15.6 tok/s12438 ms96K
Agentic CodingSRuns well15.6 tok/s18092 ms96K
ReasoningSRuns well15.6 tok/s14700 ms96K
RAGSRuns well15.6 tok/s22615 ms96K

Quantization options

How Qwen 3.5 9B (9B params) fits at each quantization level on MacBook Pro M4 32GB (23.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
3.5 GB
LowS87
Q3_K_S
3
4.4 GB
LowS87
NVFP4
4
5.0 GB
MediumS87
Q4_K_M
4
5.5 GB
MediumS88
Q5_K_M
5
6.5 GB
HighS88
Q6_K
6
7.4 GB
HighS89
Q8_0
8
9.6 GB
Very HighS90
F16Best for your GPU
16
18.5 GB
MaximumS91

Get started

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

Run

ollama run qwen3.5:9b

Your hardware

More models your MacBook Pro M4 32GB can run

ModelParamsGradeDecodeCapabilities
👁 Alibaba
Qwen3-Coder 30B A3B Instruct
30.5BA11.7 tok/s
👁 Alibaba
Qwen 3.5 27B
27BS8.6 tok/s
👁 Alibaba
Qwen 3.6 27B
27BS7.1 tok/s
👁 Alibaba
Qwen3-VL 30B A3B Instruct
30BS12.4 tok/s

Frequently asked questions

See all results for MacBook Pro M4 32GBSee all hardware for Qwen 3.5 9B