Can Qwen3-Coder 480B A35B Instruct run on Mac Studio M2 Ultra 64GB?

NO — Won't Fit

F0Won't run

○Estimated from fit model

Qwen3-Coder 480B A35B Instruct needs ~303.5 GB but Mac Studio M2 Ultra 64GB only has 46.1 GB. Try a smaller quantization or lighter model.

Runtime: llama.cppCapacity: No fitBandwidth: HighStack: StandardBottleneck: Memory capacity

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) — 303.5 GB, exceeds 46.1 GB available

303.5 GB required46.1 GB available

658% VRAM needed

257.4 GB over capacity — needs offload or smaller quantization

Fit status

Too heavy

Decode

3.4 tok/s

TTFT

57383 ms

Safe context

Memory

303.5 GB / 46.1 GB

Offload

80%

Memory breakdown

Weights292.8 GB

KV Cache2.9 GB

Runtime0.9 GB

Headroom6.9 GB

See how fast it feels

With memory offload — actual speed may be lower

See how fast it feelsQwen3-Coder 480B A35B Instruct on Mac Studio M2 Ultra 64GB
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: 3.4 tok/s decode · 57.4s TTFT (warm) · 8 tok/s prefill

What limits this setup

Usable shared or unified memory is the main blocker for this model.

Not enough usable memory

The model needs 303.5 GB, but this setup only exposes 46.1 GB of usable shared or unified memory.

Best improvement path

Move to a larger memory pool

A larger unified-memory SKU or a discrete high-bandwidth GPU is the cleanest way to make this model practical.

Performance by workload

Workload	Grade	Fit	Decode	TTFT	Context
Chat	F	Too heavy	3.1 tok/s	34234 ms	4K
Coding	F	Too heavy	3.1 tok/s	62763 ms	4K
Agentic Coding	F	Too heavy	3.1 tok/s	91291 ms	4K
Reasoning	F	Too heavy	3.1 tok/s	74174 ms	4K
RAG	F	Too heavy	3.1 tok/s	114114 ms	4K