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:38Tomislav TunkovicTomislav TunkovicScore: 1,867Success
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:391,862289,309,707271,058,0008,290,00016,027,648stderr
2Aug 15, 2026 15:391,864289,738,324270,415,0009,294,00016,027,648stderr
3Aug 15, 2026 15:391,864289,608,122271,204,0008,423,00016,027,648stderr
4Aug 15, 2026 15:391,866290,780,311271,655,0008,379,00016,027,648stderr
5Aug 15, 2026 15:391,867290,942,492271,819,0008,352,00016,027,648stderr
6Aug 15, 2026 15:391,867290,990,226271,678,0008,495,00016,027,648stderr
7Aug 15, 2026 15:391,870291,253,629272,157,0008,348,00016,027,648stderr
8Aug 15, 2026 15:391,871291,411,834272,307,0008,349,00016,027,648stderr
9Aug 15, 2026 15:391,871291,463,339272,190,0008,529,00016,027,648stderr