In 1880, the U.S. Census took eight years to count 50 million people. By the time the results were published, they were already obsolete. The Census Bureau feared the 1890 count — projected at 63 million — might take longer than the decade itself. A young engineer named Herman Hollerith, working at the Bureau and watching clerks hand-tally tick marks for years, decided to mechanize the problem.

His solution was filed as U.S. Patent 395,782, "Art of Compiling Statistics," granted January 8, 1889. The mechanism: encode each person's data — age, sex, race, occupation, marital status — as a pattern of holes punched into a stiff card the size of an 1887 dollar bill. To tabulate, a clerk placed the card under a press of spring-loaded pins. Where a hole existed, the pin dropped through into a mercury-filled cup beneath, completing an electrical circuit that advanced a counter dial by one. To sort, the same circuit triggered a solenoid that flipped open the lid of a corresponding sorting bin.

It was, in essence, a parallel query engine. Set the wiring to "count cards where column-12 = female AND column-22 = widowed" and the machine performed what we'd now call a SELECT COUNT(*) WHERE filter — at roughly 80 cards per minute, against millions of records.

The 1890 Census finished in six weeks for the initial population count, and the full statistical analysis in two years. Hollerith's machines saved the government an estimated $5 million (about $170 million today). Governments worldwide lined up: Russia, Austria, Canada, France, Norway. In 1896 Hollerith founded the Tabulating Machine Company. In 1911 it merged with three others. In 1924 the conglomerate renamed itself International Business Machines — IBM.

What's startling is how many modern concepts the patent already contained:

• Structured records with fixed fields — each column position meant something specific. This is a database schema.
• Boolean query composition — by wiring multiple sensing pins in series (AND) or parallel (OR), an operator built compound predicates. This is SQL's WHERE clause as copper and mercury.
• Indexed sorting — the sorter bins are a one-pass radix sort, the same algorithm modern databases use for billion-row joins.
• Separation of storage and compute — cards (data) were physically distinct from the tabulator (processor). Swap the cards, run a different query. This is the architectural premise of every data warehouse from Teradata to Snowflake.
• Batch processing — load a tray, return later for results. The mainframe job queue, born 70 years before mainframes.

The punched card itself outlived Hollerith by half a century. FORTRAN, COBOL, and the entire 1960s programming workflow ran on 80-column cards descended directly from his 1889 design. The IBM 80-column card was standardized in 1928 — and the column count survives in your terminal emulator's default width today.

Could it be built better now? It already was: every analytical database — BigQuery, Redshift, ClickHouse, DuckDB — is Hollerith's machine with the mercury cups replaced by SSDs and the sorting bins replaced by hash partitions. The conceptual leap was his. The semiconductors are an implementation detail.