I got AC but used lots of memory.

currently I use a very large lookup table such as

int hash[7][7][7][7][7][7] for look up a given dice's scheme

what's the optimal approach that can minimize the memory usage and also get 0.001s time result?

Thanks!