// C++ hash table benchmark
#include <assert.h>
#include <set>
#include <string>

#define N 22

int main()
{
    int len = 0;
    std::set<std::string> ht;
    for (int i = 0; i < 1<<N; i++) {
        auto v = std::to_string(i);
        auto r = ht.insert(v);
        len += r.second;
    }
    assert(len == 1<<N);
    return 0;
}