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:47Andrew EpsteinAndrew EpsteinScore: 10,378Success
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:4810,3711,566,772,2921,524,757,00031,016,00016,801,792stderr
2Sep 21, 2026 15:4810,3751,566,984,7361,524,642,00031,711,00016,801,792stderr
3Sep 21, 2026 15:4810,3751,567,427,7681,525,060,00031,292,00016,801,792stderr
4Sep 21, 2026 15:4810,3771,567,044,5531,525,547,00031,031,00016,797,696stderr
5Sep 21, 2026 15:4810,3781,567,112,3981,525,649,00031,052,00016,801,792stderr
6Sep 21, 2026 15:4810,3821,567,886,0251,526,449,00030,923,00016,801,792stderr
7Sep 21, 2026 15:4810,3871,568,440,7211,526,895,00031,204,00016,801,792stderr
8Sep 21, 2026 15:4810,3881,568,666,4861,527,209,00031,045,00016,801,792stderr
9Sep 21, 2026 15:4810,3911,570,260,7261,527,525,00031,200,00016,801,792stderr