Complexity of insertion to container

In my project I use the following container to store unique resource consumers.

typedef std::map<std::string, tokens> Consumers;  
typedef std::unordered_set<std::string> Tokens;

I'll have approximately 10 keys but hundreds of thousands of tokens

What is the complexity of insertion of 1 Consumer?