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 16:57Andrew EpsteinAndrew EpsteinScore: 16,337Success
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 16:5816,3312,460,036,8442,401,098,00048,636,00016,801,792stderr
2Sep 21, 2026 16:5816,3312,460,027,6482,400,705,00049,006,00016,797,696stderr
3Sep 21, 2026 16:5816,3342,460,798,9212,400,567,00049,665,00016,801,792stderr
4Sep 21, 2026 16:5816,3342,460,482,9642,400,914,00049,236,00016,801,792stderr
5Sep 21, 2026 16:5816,3372,461,503,3322,401,782,00048,807,00016,801,792stderr
6Sep 21, 2026 16:5816,3372,461,673,6222,401,290,00049,273,00016,801,792stderr
7Sep 21, 2026 16:5816,3682,466,125,1772,406,306,00048,910,00016,801,792stderr
8Sep 21, 2026 16:5816,3692,465,778,2072,406,288,00049,135,00016,801,792stderr
9Sep 21, 2026 16:5816,3712,466,289,7622,406,612,00049,182,00016,801,792stderr