The Algorithmic Information Theory (AIT) Data Compression Challenge is to build a lossless compression system with both a compressor and decompressor. The implementation must stay within 8 GB peak RAM and the decompressor binary must be at most 1024 KB. Submit your binaries according to CompressorName inputFileName outputFileName and DecompressorName inputFileName outputFileName to pratas@ua.pt. Results can now be viewed per dataset and for the overall aggregate across all files. Times are calculated with median. Weissman score is calculated against gzip for the currently selected dataset. To download the dataset, click here (number of bytes uncompressed overall: 13,136,308). In the Ranking Table, click column headers to sort. Search and Ignore by text patterns (these can be combined).
Showing results for Overall
Showing results for Overall
| Rank | Compressor | Compressed (Bytes) | Ratio | bits/byte | t_comp (s) | t_decomp (s) | t_total (s) | Lossless |
|---|
Computed with gzip as reference for Overall
| # | Compressor | Weissman Score | Ratio | t_total (s) | Lossless |
|---|