AI engineering and inferenceLoading progress…

Cost units

Calculate cost per token, estimate stable concurrency and define operational metrics tied to user-facing objectives.

What is a unit of cost?

"Cost per token" hides choices. Are input tokens counted, output tokens, or both? Which costs are in: the accelerator, the host, networking, staff? And what throughput do you divide by? Use the measured, sustained rate, not peak arithmetic capacity.

Worked example: $2/hour at 100 useful output tokens/s costs 2 × 1,000,000 / (3600 × 100) ≈ $5.5556 per million output tokens.

$ per hour$2sustained output tokens/s100input tokens per request800output tokens per request100peak tokens/s (marketing number)200
unitformuladollars
per million OUTPUT tokens2 × 10⁶ / (3600 × 100)5.5556
per request1 requests/s0.000556
per million COMBINED tokensper request / (800 + 100) × 10⁶0.6173
per million output tokens using the PEAK rateoptimistic2.7778

State what is counted (input, output or both) and which costs are included, and use the sustained, measured rate. Peak arithmetic flatters the result.

The same machine under three definitions of a unit.

Predict first. Is dollars per million output tokens identical to dollars per million combined tokens?

Chapter context

An efficient service delivers useful requests within latency and quality targets at a sustainable cost. Hardware utilization, application traffic and failure handling determine whether an attractive benchmark becomes an economical deployment.

Chapter reference: math, worked example & code

This section belongs to the whole chapter, so it is the same on every lesson in it and may cover a different lesson's topic. The code for the experiment you just ran is inside the experiment itself.

Math and notation

For hourly cost H and useful sustained output rate r:

Cmillion=106H3600r.C_{million}=\frac{10^6H}{3600r}.

For a stable system under compatible averages, Little's law is L=λWL=\lambda W: average in-system requests equal arrival rate times average time in system. It does not make an unstable queue stable.

Worked example

At a fictional 2/hourand100usefuloutputtokens/s,costis2×1,000,000/(3600×100)≈2/hour and 100 useful output tokens/s, cost is 2×1,000,000/(3600×100)≈5.5556 per million output tokens, excluding other costs. If useful throughput falls to 50, cost doubles to about $11.1111. At four requests/s and two seconds average in-system time, average concurrent requests are eight.

Reference code

The following example uses the Python standard library and does not call a remote service.

from math import isclose
cost=lambda rate: 1_000_000*2/(3600*rate)
assert isclose(cost(100),5.555555555555555)
assert isclose(cost(50),2*cost(100))
assert 4*2 == 8

Python examples are provided for study and local execution; this page does not execute Python.

Common mistakes

Fictional arithmetic prices are not current provider quotes. Little's law requires a stable, consistently measured system. Counting failed or late tokens as useful throughput can hide poor service.