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:28Tomislav TunkovicTomislav TunkovicScore: 1,697Success
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:301,694264,300,471245,933,0008,305,00016,027,648stderr
2Aug 15, 2026 15:301,694264,207,709245,827,0008,356,00016,027,648stderr
3Aug 15, 2026 15:301,695265,137,702245,960,0008,384,00016,027,648stderr
4Aug 15, 2026 15:301,696264,524,447245,244,0009,246,00016,027,648stderr
5Aug 15, 2026 15:301,697264,565,382245,254,0009,333,00016,027,648stderr
6Aug 15, 2026 15:301,699264,947,153246,419,0008,507,00016,027,648stderr
7Aug 15, 2026 15:301,699265,709,805246,477,0008,465,00016,027,648stderr
8Aug 15, 2026 15:301,700265,704,539246,589,0008,445,00016,027,648stderr
9Aug 15, 2026 15:301,711276,582,700246,977,0009,683,00016,027,648stderr