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 13:45Andrew EpsteinAndrew EpsteinScore: 24,897Success
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 13:4624,8333,736,440,6743,604,226,000120,872,00016,797,696stderr
2Sep 21, 2026 13:4624,8603,739,440,5703,607,828,000121,211,00016,797,696stderr
3Sep 21, 2026 13:4624,8683,740,967,1213,608,109,000122,136,00016,801,792stderr
4Sep 21, 2026 13:4624,8813,743,532,8623,610,373,000121,803,00016,797,696stderr
5Sep 21, 2026 13:4624,8973,745,041,2473,613,166,000121,423,00016,801,792stderr
6Sep 21, 2026 13:4624,9043,746,769,7533,613,840,000121,836,00016,797,696stderr
7Sep 21, 2026 13:4624,9113,747,682,3953,615,121,000121,581,00016,797,696stderr
8Sep 21, 2026 13:4624,9483,757,590,3863,619,356,000122,851,00016,801,792stderr
9Sep 21, 2026 13:4624,9513,753,239,7823,619,960,000122,697,00016,801,792stderr