Mac Studio M3 Ultra 256GBBudget pick
256 GB Unified (+76)
B
This setup is broadly balanced for this model.21 tok/s decode
~$6,999 MSRP
Can Qwen 2.5 Coder 1.5B run on NVIDIA B200 180GB?
YES — Runs Great
B58Good
○Estimated from fit model
Qwen 2.5 Coder 1.5B needs ~20.5 GB VRAM. NVIDIA B200 180GB has 180.0 GB. With Q4_K_M quantization, expect ~21 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.
Select quantization to explore
Q4_K_M (Medium quality) — 20.5 GB, 21.0 tok/s, Runs well
20.5 GB required180.0 GB available
11% VRAM used
Fit status
Runs well
Decode
21.0 tok/s
TTFT
9219 ms
Safe context
33K
Memory
20.5 GB / 180.0 GB
Memory breakdown
Weights0.9 GB
KV Cache0.4 GB
Runtime1.2 GB
Headroom18.0 GB
See how fast it feels
See how fast it feelsQwen 2.5 Coder 1.5B on NVIDIA B200 180GB
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.0 tok/s decode · 9.2s TTFT (warm) · 53 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
| Workload | Grade | Fit | Decode | TTFT | Context |
|---|---|---|---|---|---|
| Chat | B | Runs well | 21.0 tok/s | 5029 ms | 33K |
| Coding | B | Runs well | 21.0 tok/s | 9219 ms | 33K |
| Agentic Coding | B | Runs well | 21.0 tok/s | 13410 ms | 33K |
| Reasoning | B | Runs well | 21.0 tok/s | 10895 ms | 33K |
| RAG | B | Runs well | 21.0 tok/s | 16762 ms | 33K |
Quantization options
How Qwen 2.5 Coder 1.5B (1.5B params) fits at each quantization level on NVIDIA B200 180GB (180.0 GB usable).
| Quant | Bits | VRAM | Quality | Fit |
|---|---|---|---|---|
Q2_K | 2 | 0.6 GB | Low | B56 |
Q3_K_S | 3 | 0.7 GB | Low | B56 |
NVFP4 | 4 |
Get started
Copy-paste commands to run Qwen 2.5 Coder 1.5B on your machine.
Run
ollama run qwen2.5-coder:1.5bUpgrade options