What data structure would you use for efficient storage and frequent addition of large volumes of integers?

For efficient storage and frequent addition of large volumes of integers in C/C++, dynamic data structures such as std::vector are usually used. It allows for quick appending of elements at the end with amortized constant time complexity and manages memory automatically.

Example of using std::vector:

#include <vector>

std::vector<int> numbers;
numbers.push_back(10);
numbers.push_back(20);
// Adding a large number of elements
for (int i = 0; i < 1000000; ++i) {
    numbers.push_back(i);
}

If speed of insertion in the middle or at the beginning is important, std::deque can be considered, but for most tasks involving appending at the end, std::vector is the optimal choice.