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 15:56Andrew EpsteinAndrew EpsteinScore: 20,239Success
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 15:5720,2293,045,461,2552,977,137,00057,348,00016,797,696stderr
2Sep 21, 2026 15:5720,2343,046,480,5902,977,102,00058,084,00016,797,696stderr
3Sep 21, 2026 15:5720,2383,047,068,4292,977,674,00058,080,00016,801,792stderr
4Sep 21, 2026 15:5720,2393,046,450,5912,977,815,00058,142,00016,801,792stderr
5Sep 21, 2026 15:5720,2393,046,816,7722,978,543,00057,355,00016,801,792stderr
6Sep 21, 2026 15:5720,2403,047,450,0442,978,631,00057,481,00016,801,792stderr
7Sep 21, 2026 15:5720,2633,050,487,6692,981,753,00057,705,00016,801,792stderr
8Sep 21, 2026 15:5720,2723,051,907,2212,982,755,00058,116,00016,801,792stderr
9Sep 21, 2026 15:5720,2773,052,626,7262,983,819,00057,854,00016,801,792stderr