I have a 20x30 array which contains values of int type. Each row should be concentrated into one number. For example, consider a 3x4 array: |1 3 6 1| |4 2 5 2| |8 3 1 5| It should become: |1361, 4252, 8315| The problem is that, I have 30 numbers so I need 30 digits, and the biggest number I can store using unsigned long long int is +18,446,744,073,709,551,615 which contains only 20 digits
ORIGINAL PROBLEM: The previous problem is a part of an assignment, where I have a hash function which returns a Nx30 array. Each row of the array consists of 30 integers and putting them together, represents a 30digit hash value of one of the N input data.
I have to sort those hashes using radix sort. My instructor told me that i can match those 30 digits in a 64bit integer. Given that the hash values are in range of 0-3, can I concentrate them, using 2 bits for each one, in a 64bit array?