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 15, 2026 15:03Tomislav TunkovicTomislav TunkovicScore: 1,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 15:031,748272,217,740250,101,00012,144,00016,805,888stderr
2Aug 15, 2026 15:031,748272,387,666249,913,00012,319,00016,805,888stderr
3Aug 15, 2026 15:031,749272,417,897250,135,00012,295,00016,805,888stderr
4Aug 15, 2026 15:031,750273,369,169250,709,00011,934,00016,805,888stderr
5Aug 15, 2026 15:031,750272,676,247250,266,00012,322,00016,805,888stderr
6Aug 15, 2026 15:031,751272,791,786250,749,00011,954,00016,805,888stderr
7Aug 15, 2026 15:031,751273,555,547250,859,00011,886,00016,805,888stderr
8Aug 15, 2026 15:031,753273,859,139251,053,00011,984,00016,805,888stderr
9Aug 15, 2026 15:031,753273,142,412251,068,00012,017,00016,805,888stderr