VOOZH about

URL: https://willitrunai.com/can-run/exaone-4-32b-on-l40-48gb


Can EXAONE 4.0 32B run on NVIDIA L40 48GB?

YES — Runs Great

S87Excellent
Estimated from fit model

EXAONE 4.0 32B needs ~29.4 GB VRAM. NVIDIA L40 48GB has 48.0 GB. With Q4_K_M quantization, expect ~35 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.

Capabilities:

Select quantization to explore

Q4_K_M (Medium quality) — 29.4 GB, 37.3 tok/s, Runs well
29.4 GB required48.0 GB available
61% VRAM used

Fit status

Runs well

Decode

37.3 tok/s

TTFT

5192 ms

Safe context

92K

Memory

29.4 GB / 48.0 GB

Memory breakdown

Weights19.5 GB
KV Cache3.9 GB
Runtime1.2 GB
Headroom4.8 GB

See how fast it feels

See how fast it feelsEXAONE 4.0 32B 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: 37.3 tok/s decode · 5.2s TTFT (warm) · 93 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

WorkloadGradeFitDecodeTTFTContext
ChatSRuns well34.5 tok/s3059 ms92K
CodingSRuns well34.5 tok/s5608 ms92K
Agentic CodingSRuns well34.5 tok/s8157 ms92K
ReasoningSRuns well34.5 tok/s6627 ms92K
RAGSRuns well34.5 tok/s10196 ms92K

Quantization options

How EXAONE 4.0 32B (32B params) fits at each quantization level on NVIDIA L40 48GB (48.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
12.5 GB
LowA79
Q3_K_S
3
15.7 GB
LowA80
NVFP4
4

Get started

Copy-paste commands to run EXAONE 4.0 32B on your machine.

Run

ollama run exaone-4:32b

Your hardware

More models your NVIDIA L40 48GB can run

ModelParamsGradeDecodeCapabilities
👁 Alibaba
Qwen 3.6 35B A3B
35BS91.6 tok/s
👁 Alibaba

Frequently asked questions

See all results for NVIDIA L40 48GBSee all hardware for EXAONE 4.0 32B
17.9 GB
Medium
A81
Q4_K_M
4
19.5 GB
MediumA81
Q5_K_M
5
23.0 GB
HighA82
Q6_K
6
26.2 GB
HighA83
Q8_0Best for your GPU
8
34.2 GB
Very HighA83
F16
16
65.6 GB
MaximumF0
Qwen 3.5 35B A3B
35B
S
99.7 tok/s
👁 Alibaba
Qwen 2.5 VL 72B
72BA9.5 tok/s
👁 Alibaba
Qwen3-Coder-Next
80BA24.4 tok/s