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 17:15Andrew EpsteinAndrew EpsteinScore: 19,332Success
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 17:1619,3222,908,829,0252,840,473,00057,851,00016,801,792stderr
2Sep 21, 2026 17:1619,3242,909,244,4442,840,345,00058,396,00016,801,792stderr
3Sep 21, 2026 17:1619,3262,909,966,3842,841,418,00057,589,00016,801,792stderr
4Sep 21, 2026 17:1619,3262,909,644,8022,840,619,00058,396,00016,801,792stderr
5Sep 21, 2026 17:1619,3322,910,246,4852,842,004,00057,860,00016,801,792stderr
6Sep 21, 2026 17:1619,3372,911,074,9632,842,909,00057,735,00016,801,792stderr
7Sep 21, 2026 17:1619,3662,915,442,8702,846,975,00058,074,00016,801,792stderr
8Sep 21, 2026 17:1619,3712,916,256,6012,847,742,00058,051,00016,801,792stderr
9Sep 21, 2026 17:1619,3742,916,573,7922,848,231,00057,996,00016,801,792stderr