Can Granite Code 3B run on NVIDIA L40 48GB?

YES — Runs Great

B60Good

○Estimated from fit model

Granite Code 3B needs ~10.0 GB VRAM. NVIDIA L40 48GB has 48.0 GB. With Q4_K_M quantization, expect ~42 tok/s.

Runtime: llama.cppCapacity: RoomyBandwidth: HighStack: StandardBottleneck: 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.0 GB, 48.0 tok/s, Runs well

10.0 GB required48.0 GB available

21% VRAM used

Fit status

Runs well

Decode

48.0 tok/s

TTFT

4033 ms

Safe context

Memory

10.0 GB / 48.0 GB

Memory breakdown

Weights1.8 GB

KV Cache2.5 GB

Runtime0.9 GB

Headroom4.8 GB

See how fast it feels

See how fast it feelsGranite Code 3B on NVIDIA L40 48GB
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: 48.0 tok/s decode · 4.0s TTFT (warm) · 120 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	42.0 tok/s	2514 ms	8K
Coding	B	Runs well	42.0 tok/s	4610 ms	8K
Agentic Coding	B	Runs well	42.0 tok/s	6705 ms	8K
Reasoning	B	Runs well	42.0 tok/s	5448 ms	8K
RAG	B	Runs well	42.0 tok/s	8381 ms	8K

Quantization options

How Granite Code 3B (3B params) fits at each quantization level on NVIDIA L40 48GB (48.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	1.2 GB	Low	B57
Q3_K_S	3	1.5 GB	Low	B57
NVFP4	4

Get started

Copy-paste commands to run Granite Code 3B on your machine.

Run

ollama run granite-code:3b

Frequently asked questions

See all results for NVIDIA L40 48GB See all hardware for Granite Code 3B

URL: https://willitrunai.com/can-run/granite-code-3b-on-l40-48gb

⇱