I personally consider using a tuple the quick & dirty approach. If your three integers have a specific purpose it is much better to write a little struct:

struct my_data_t
{
  int a;
  int b;
  int c;
};

QHash<QString,my_data_t> hash;
...
hash["key"].b;

It could be a fixed set of entries - which might not be modified.

Then a multihash is not the correct container as already pointed out by @SimonSchroeder

It could be a fixed set of entries - which might not be modified.
However @SimonSchroeder gave me a nice idea what to do.

thx guys.

I personally consider using a tuple the quick & dirty approach. If your three integers have a specific purpose it is much better to write a little struct:

struct my_data_t
{
  int a;
  int b;
  int c;
};

QHash<QString,my_data_t> hash;
...
hash["key"].b;

I could not find such a routine. It would always need:

How should it work otherwise? Since you don't know how many elements you get for one value you must not directly access the third (in your case) element but check the size of the returned container first.

You mean this example:

QMultiHash<QString, int> hash1, hash2, hash3;
hash1.insert("plenty", 100);
hash1.insert("plenty", 2000);

In my example this would be:
QMultiHash<QString, int> hash;
hash.insert("plenty", 100);
hash.insert("plenty", 2000);
hash.insert("plenty", 50);

How to access the second value? Is there something like

hash.getValue(2);

I could not find such a routine. It would always need:

QList<int> values = hash.values("plenty");   values.at(2);

Is this possible and if yes - how?

Yes it is. What exactly is the problem?
In documentation you can even find an example for exactly what you're asking: https://doc.qt.io/qt-5/qmultihash.html