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:25Andrew EpsteinAndrew EpsteinScore: 16,925Success
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:2616,9222,548,730,7862,489,145,00049,236,00016,801,792stderr
2Sep 21, 2026 15:2616,9222,548,793,8262,488,936,00049,492,00016,801,792stderr
3Sep 21, 2026 15:2616,9232,548,999,4922,489,282,00049,305,00016,801,792stderr
4Sep 21, 2026 15:2616,9242,548,925,7192,489,181,00049,430,00016,801,792stderr
5Sep 21, 2026 15:2616,9252,549,252,9172,489,260,00049,612,00016,797,696stderr
6Sep 21, 2026 15:2616,9252,549,383,6642,489,140,00049,616,00016,801,792stderr
7Sep 21, 2026 15:2616,9492,553,977,7312,492,916,00049,503,00016,801,792stderr
8Sep 21, 2026 15:2616,9512,553,086,3562,493,197,00049,485,00016,801,792stderr
9Sep 21, 2026 15:2616,9562,553,709,9282,493,709,00049,709,00016,801,792stderr