Can InternLM 20B run on NVIDIA H100 80GB?

YES — Runs Great

B61Good

○Estimated from fit model

InternLM 20B needs ~41.6 GB VRAM. NVIDIA H100 80GB has 80.0 GB. With Q5_K_M quantization, expect ~199 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

Q5_K_M (High quality) — 41.6 GB, 199.3 tok/s, Runs well

41.6 GB required80.0 GB available

52% VRAM used

Fit status

Runs well

Decode

199.3 tok/s

TTFT

971 ms

Safe context

Memory

41.6 GB / 80.0 GB

Memory breakdown

Weights14.4 GB

KV Cache18.3 GB

Runtime0.9 GB

Headroom8.0 GB

See how fast it feels

See how fast it feelsInternLM 20B on NVIDIA H100 80GB
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: 199.3 tok/s decode · 971ms TTFT (warm) · 498 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	199.3 tok/s	530 ms	8K
Coding	B	Runs well	199.3 tok/s	971 ms	8K
Agentic Coding	B	Runs well	199.3 tok/s	1413 ms	8K
Reasoning	B	Runs well	199.3 tok/s	1148 ms	8K
RAG	B	Runs well	199.3 tok/s	1766 ms	8K

Quantization options

How InternLM 20B (20B params) fits at each quantization level on NVIDIA H100 80GB (80.0 GB usable).

Quant	Bits	VRAM	Quality	Fit
Q2_K	2	7.8 GB	Low	C48
Q3_K_S	3	9.8 GB	Low	C48
NVFP4	4

Get started

Copy-paste commands to run InternLM 20B on your machine.

Run

docker run --rm -it ghcr.io/ggerganov/llama.cpp:full \
 --hf-repo "internlm/internlm2_5-20b-chat" \
 --hf-file "internlm2_5-20b-chat-Q5_K_M.gguf" \
 -c 4096 -ngl 99

Frequently asked questions

See all results for NVIDIA H100 80GB See all hardware for InternLM 20B

URL: https://willitrunai.com/can-run/internlm-20b-on-h100-80gb

⇱