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 18:15Tomislav TunkovicTomislav TunkovicScore: 1,642Success
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 18:431,637253,961,826237,178,0008,476,00016,027,648
2Aug 17, 2026 18:431,638254,289,274236,419,0009,368,00016,027,648
3Aug 17, 2026 18:431,640254,474,218236,626,0009,389,00016,027,648
4Aug 17, 2026 18:431,641254,675,459236,867,0009,322,00016,027,648
5Aug 17, 2026 18:431,642254,723,920236,882,0009,446,00016,027,648
6Aug 17, 2026 18:431,642254,715,025236,857,0009,450,00016,027,648
7Aug 17, 2026 18:431,642254,711,722236,860,0009,448,00016,027,648
8Aug 17, 2026 18:431,644255,117,097237,227,0009,449,00016,027,648
9Aug 17, 2026 18:431,706275,728,347244,205,00011,812,00016,027,648