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:53Andrew EpsteinAndrew EpsteinScore: 16,449Success
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:5416,4442,481,242,1772,418,023,00048,587,00016,797,696stderr
2Sep 21, 2026 15:5416,4482,477,837,0822,417,993,00049,292,00016,801,792stderr
3Sep 21, 2026 15:5416,4492,477,889,3052,418,801,00048,663,00016,801,792stderr
4Sep 21, 2026 15:5416,4492,477,819,0622,418,679,00048,770,00016,801,792stderr
5Sep 21, 2026 15:5416,4492,478,415,9912,418,697,00048,741,00016,801,792stderr
6Sep 21, 2026 15:5416,4522,478,297,6142,418,601,00049,267,00016,797,696stderr
7Sep 21, 2026 15:5416,4762,483,021,4882,422,498,00049,018,00016,801,792stderr
8Sep 21, 2026 15:5416,4762,481,770,2562,422,476,00049,034,00016,801,792stderr
9Sep 21, 2026 15:5416,4812,483,245,4792,423,221,00048,994,00016,801,792stderr