It needs to be a lossless compression scheme and the order needs not to be preserved
Without preserving the order, you can reduce it to 720 bytes (or even less). You just have to count the number of times every number appear and store that (using 64bit integers, 8 * 90 = 720bytes)
In reply to Re: Data compression by 50% + : is it possible?
by salva
in thread Data compression by 50% + : is it possible?
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |