VOOZH about

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


Can EXAONE 4.0 32B run on NVIDIA A100 40GB?

YES — Runs Great

S91Excellent
Estimated from fit model

EXAONE 4.0 32B needs ~28.6 GB VRAM. NVIDIA A100 40GB has 40.0 GB. With Q4_K_M quantization, expect ~72 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) — 28.6 GB, 72.3 tok/s, Runs well
28.6 GB required40.0 GB available
72% VRAM used

Fit status

Runs well

Decode

72.3 tok/s

TTFT

2679 ms

Safe context

63K

Memory

28.6 GB / 40.0 GB

Memory breakdown

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

See how fast it feels

See how fast it feelsEXAONE 4.0 32B on NVIDIA A100 40GB
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: 72.3 tok/s decode · 2.7s TTFT (warm) · 181 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 well72.3 tok/s1461 ms63K
CodingSRuns well72.3 tok/s2679 ms63K
Agentic CodingSRuns well72.3 tok/s3897 ms63K
ReasoningSRuns well72.3 tok/s3166 ms63K
RAGSRuns well72.3 tok/s4871 ms63K

Quantization options

How EXAONE 4.0 32B (32B params) fits at each quantization level on NVIDIA A100 40GB (40.0 GB usable).

QuantBitsVRAMQualityFit
Q2_K
2
12.5 GB
LowA80
Q3_K_S
3
15.7 GB
LowA82
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 A100 40GB can run

ModelParamsGradeDecodeCapabilities
👁 Alibaba
Qwen 3.6 35B A3B
35BS166 tok/s
👁 Alibaba

Frequently asked questions

See all results for NVIDIA A100 40GBSee all hardware for EXAONE 4.0 32B
17.9 GB
Medium
A83
Q4_K_M
4
19.5 GB
MediumA83
Q5_K_M
5
23.0 GB
HighA84
Q6_KBest for your GPU
6
26.2 GB
HighA83
Q8_0
8
34.2 GB
Very HighF0
F16
16
65.6 GB
MaximumF0
Qwen 3.5 35B A3B
35B
S
180.5 tok/s