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 listAug 15, 2026 06:33Tomislav TunkovicTomislav TunkovicScore: 1,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 06:331,748272,335,343250,483,00011,771,00016,801,792stderr
2Aug 15, 2026 06:331,749272,546,106250,606,00011,875,00016,801,792stderr
3Aug 15, 2026 06:331,751273,507,658251,152,00011,631,00016,801,792stderr
4Aug 15, 2026 06:331,752273,714,097251,263,00011,598,00016,801,792stderr
5Aug 15, 2026 06:331,752272,878,101250,854,00011,957,00016,801,792stderr
6Aug 15, 2026 06:331,753273,962,801251,455,00011,626,00016,801,792stderr
7Aug 15, 2026 06:331,754273,922,509251,435,00011,694,00016,801,792stderr
8Aug 15, 2026 06:331,755274,041,102251,575,00011,755,00016,801,792stderr
9Aug 15, 2026 06:331,756273,676,519251,706,00011,769,00016,801,792stderr