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 17, 2026 13:28Tomislav TunkovicTomislav TunkovicScore: 1,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 13:421,628254,098,541235,957,0008,305,00016,023,552
2Aug 17, 2026 13:421,630254,545,808236,102,0008,544,00016,023,552
3Aug 17, 2026 13:421,630254,478,542236,070,0008,507,00016,023,552
4Aug 17, 2026 13:421,631254,623,913236,428,0008,312,00016,023,552
5Aug 17, 2026 13:421,631254,550,629236,102,0008,552,00016,023,552
6Aug 17, 2026 13:421,631254,579,522236,134,0008,597,00016,023,552
7Aug 17, 2026 13:421,632254,821,736236,404,0008,536,00016,023,552
8Aug 17, 2026 13:421,632254,887,467236,303,0008,503,00016,023,552
9Aug 17, 2026 13:421,637255,554,983237,220,0008,441,00016,023,552