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 listNov 4, 2026 02:48Andrew EpsteinAndrew EpsteinScore: 15,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 02:4915,5392,340,331,5902,292,907,00037,961,00016,801,792stderr
2Nov 4, 2026 02:4915,5412,340,594,5572,293,241,00037,977,00016,801,792stderr
3Nov 4, 2026 02:4915,5442,341,330,9522,293,370,00038,293,00016,801,792stderr
4Nov 4, 2026 02:4915,5452,341,133,3822,293,599,00038,204,00016,801,792stderr
5Nov 4, 2026 02:4915,5462,341,377,7772,293,863,00038,077,00016,801,792stderr
6Nov 4, 2026 02:4915,5462,341,310,1972,293,799,00038,151,00016,801,792stderr
7Nov 4, 2026 02:4915,5742,345,680,8852,297,736,00038,474,00016,801,792stderr
8Nov 4, 2026 02:4915,5772,346,038,7182,298,081,00038,471,00016,801,792stderr
9Nov 4, 2026 02:4915,5812,346,636,8722,298,881,00038,411,00016,801,792stderr