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:12Andrew EpsteinAndrew EpsteinScore: 21,574Success
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:1421,5593,244,586,0883,177,106,00056,846,00016,801,792stderr
2Sep 21, 2026 15:1421,5593,244,918,5023,177,729,00056,220,00016,801,792stderr
3Sep 21, 2026 15:1421,5713,246,021,5613,179,142,00056,512,00016,801,792stderr
4Sep 21, 2026 15:1421,5733,246,590,5503,178,766,00057,197,00016,801,792stderr
5Sep 21, 2026 15:1421,5743,247,322,0763,179,412,00056,729,00016,801,792stderr
6Sep 21, 2026 15:1421,5773,246,976,3723,180,347,00056,287,00016,801,792stderr
7Sep 21, 2026 15:1421,6113,252,881,5523,185,199,00056,561,00016,801,792stderr
8Sep 21, 2026 15:1421,6153,252,710,1143,185,598,00056,664,00016,801,792stderr
9Sep 21, 2026 15:1421,6363,255,819,6683,188,805,00056,598,00016,801,792stderr