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 listAug 19, 2026 15:02Victor MerckléVictor MerckléScore: 1,637Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:031,635255,193,455237,122,0008,135,00016,801,792stderr
2Aug 19, 2026 15:031,635255,184,002237,251,0008,070,00016,801,792stderr
3Aug 19, 2026 15:031,635257,132,711237,147,0008,116,00016,801,792stderr
4Aug 19, 2026 15:031,636255,413,974237,371,0008,050,00016,801,792stderr
5Aug 19, 2026 15:031,637255,463,743237,456,0008,102,00016,801,792stderr
6Aug 19, 2026 15:031,637255,472,448237,243,0008,344,00016,801,792stderr
7Aug 19, 2026 15:031,639255,801,191237,705,0008,162,00016,801,792stderr
8Aug 19, 2026 15:031,640255,912,899237,886,0008,117,00016,801,792stderr
9Aug 19, 2026 15:031,661269,499,643240,893,0008,266,00016,801,792stderr