# How fast is C++26's std::hive?

DevFeed: [How fast is C++26's std::hive?](<https://devfeed.tech/articles/how-fast-is-c-26-s-std-hive-29419.md>)

Original publisher: [Read original article](<https://lemire.me/blog/2026/08/02/how-fast-is-c26s-stdhive/>)

Author: Daniel Lemire

Published: 2026-08-02T17:00:10Z

Content type: article

Language: en

Sources: [Daniel Lemire](<https://devfeed.tech/sources/daniel-lemire.md>)

Topics: [container](<https://devfeed.tech/topics/container.md>), [Data structures](<https://devfeed.tech/topics/data-structures.md>), [cpu](<https://devfeed.tech/topics/cpu.md>), [intel](<https://devfeed.tech/topics/intel.md>)

Tags: [compiler](<https://devfeed.tech/tags/compiler.md>), [container](<https://devfeed.tech/tags/container.md>), [data-structure](<https://devfeed.tech/tags/data-structure.md>), [intel](<https://devfeed.tech/tags/intel.md>), [processor](<https://devfeed.tech/tags/processor.md>), [standard-library](<https://devfeed.tech/tags/standard-library.md>)

## AI overview

The article benchmarks a C++26 std::hive implementation against vector, list, and another container. In the reported tests, hive insertion costs about twice as much as vector insertion, while iteration is about eight times slower than vector and no faster than linked-list iteration.

## Source excerpt

C++26 adds a new container to the standard library: std::hive. It is meant to occupy the ground between std::vector and std::list. Like a vector, it keeps its elements in contiguous blocks of memory, so scanning it does not require you to chase a pointer for every element. Like a list, it never moves an element ... Continue reading How fast is C++26's std::hive?