Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listSep 21, 2026 17:04Andrew EpsteinAndrew EpsteinScore: 19,673Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 17:0619,6612,960,239,2602,891,715,00057,462,00016,801,792stderr
2Sep 21, 2026 17:0619,6662,961,715,9102,891,526,00058,410,00016,797,696stderr
3Sep 21, 2026 17:0619,6682,960,933,1712,892,796,00057,502,00016,801,792stderr
4Sep 21, 2026 17:0619,6702,962,703,9672,891,513,00059,029,00016,801,792stderr
5Sep 21, 2026 17:0619,6732,961,547,2912,892,414,00058,568,00016,801,792stderr
6Sep 21, 2026 17:0619,6742,961,636,1832,893,841,00057,389,00016,801,792stderr
7Sep 21, 2026 17:0619,7052,966,376,6122,898,030,00057,862,00016,801,792stderr
8Sep 21, 2026 17:0619,7152,967,815,1962,899,413,00057,970,00016,801,792stderr
9Sep 21, 2026 17:0619,7172,968,309,5652,899,555,00058,094,00016,801,792stderr