Can Yi 9B Coder i1 run on RTX 3090 24GB?

YES — Runs Great

C51Usable

○Estimated from fit model

Yi 9B Coder i1 needs ~10.1 GB VRAM. RTX 3090 24GB has 24.0 GB. With Q4_K_M quantization, expect ~119 tok/s.

Runtime: OllamaCapacity: RoomyBandwidth: HighStack: BasicBottleneck: Balanced

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.1 GB, 119.3 tok/s, Runs well

10.1 GB required24.0 GB available

42% VRAM used

Fit status

Runs well

Decode

119.3 tok/s

TTFT

1622 ms

Safe context

226K

Memory

10.1 GB / 24.0 GB

Memory breakdown

Weights5.5 GB

KV Cache1.1 GB

Runtime1.2 GB

Headroom2.4 GB

See how fast it feels

See how fast it feelsYi 9B Coder i1 on RTX 3090 24GB
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: 119.3 tok/s decode · 1.6s TTFT (warm) · 298 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	C	Runs well	119.3 tok/s	885 ms	226K
Coding	C	Runs well	119.3 tok/s	1622 ms	226K
Agentic Coding	C	Runs well	119.3 tok/s	2360 ms	226K
Reasoning	C	Runs well	119.3 tok/s	1917 ms	226K
RAG	C	Runs well	119.3 tok/s	2949 ms	226K

Quantization options

How Yi 9B Coder i1 (9B params) fits at each quantization level on RTX 3090 24GB (24.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	3.5 GB	Low	C44
Q3_K_S	3	4.4 GB	Low	C45
NVFP4	4

Get started

Copy-paste commands to run Yi 9B Coder i1 on your machine.

Run

lms load hf-mradermacher--yi-9b-coder-i1-gguf && lms server start

Frequently asked questions

See all results for RTX 3090 24GB See all hardware for Yi 9B Coder i1

URL: https://willitrunai.com/can-run/hf-mradermacher--yi-9b-coder-i1-gguf-on-rtx-3090-24gb

⇱