# std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::size

> C++ Atlas: `cppatlas.com/w/cpp/container/unordered_multiset/size` | Source: https://en.cppreference.com/w/cpp/container/unordered_multiset/size | Domain: Containers | Standards: C++11, C++17, C++20

Returns the number of elements in the container, i.e. std::distance(begin(), end()).

## Official Specification Summary (cppreference)

```cpp
size_type size() const noexcept; // (since C++11)
```

Returns the number of elements in the container, i.e. `std::distance(begin(), end())`.

### Parameters

(none)

### Return value

The number of elements in the container.

### Complexity

Constant.

### Example

```cpp
#include <cassert>
#include <unordered_set>

int main()
{
    std::unordered_multiset<int> nums{4, 2, 4, 2};
    assert(nums.size() == 4);
}
```

### See also

- [`empty`](https://en.cppreference.com/w/cpp/container/unordered_multiset/empty): checks whether the container is empty (public member function)
- [`max_size`](https://en.cppreference.com/w/cpp/container/unordered_multiset/max_size): returns the maximum possible number of elements (public member function)
- [`size`](https://en.cppreference.com/w/cpp/iterator/size) (C++17), [`ssize`](https://en.cppreference.com/w/cpp/iterator/size) (C++20): returns the size of a container or array (function template)

---
Attribution: content from https://en.cppreference.com/w/cpp/container/unordered_multiset/size (cppreference.com), licensed under CC-BY-SA 3.0 and GFDL. Modified: converted to markdown, study notes added. Offline snapshot of 9 February 2025.