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 13, 2026 13:50Tomislav TunkovicTomislav TunkovicScore: 1,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 13:511,834285,923,335264,521,00010,652,00016,801,792stderr
2Aug 13, 2026 13:511,834286,098,658264,548,00010,663,00016,801,792stderr
3Aug 13, 2026 13:511,835286,014,427264,672,00010,650,00016,801,792stderr
4Aug 13, 2026 13:511,835286,157,596264,780,00010,610,00016,801,792stderr
5Aug 13, 2026 13:511,836285,499,048264,758,00010,656,00016,801,792stderr
6Aug 13, 2026 13:511,838285,914,838265,172,00010,647,00016,801,792stderr
7Aug 13, 2026 13:511,838285,714,561265,226,00010,493,00016,801,792stderr
8Aug 13, 2026 13:511,840286,271,603265,402,00010,742,00016,801,792stderr
9Aug 13, 2026 13:511,843287,314,686265,714,00010,778,00016,801,792stderr