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 3, 2026 12:13Victor MerckléVictor MerckléScore: 1,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 12:141,676261,409,433243,701,0007,839,00016,801,792stderr
2Aug 3, 2026 12:141,676261,352,254243,638,0007,796,00016,801,792stderr
3Aug 3, 2026 12:141,677261,624,488243,771,0007,888,00016,801,792stderr
4Aug 3, 2026 12:141,678261,758,603243,706,0008,068,00016,801,792stderr
5Aug 3, 2026 12:141,678261,718,307243,608,0008,146,00016,801,792stderr
6Aug 3, 2026 12:141,678261,651,931243,817,0007,945,00016,801,792stderr
7Aug 3, 2026 12:141,683262,425,556244,567,0007,981,00016,801,792stderr
8Aug 3, 2026 12:141,684262,583,701244,612,0007,990,00016,801,792stderr
9Aug 3, 2026 12:141,685262,707,786244,810,0008,034,00016,801,792stderr