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 17:55Tomislav TunkovicTomislav TunkovicScore: 1,649Success
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:351,646255,268,366237,512,0009,435,00016,027,648
2Aug 17, 2026 18:351,647255,489,093237,611,0009,449,00016,027,648
3Aug 17, 2026 18:351,648255,726,800237,888,0009,392,00016,027,648
4Aug 17, 2026 18:351,649255,743,137238,011,0009,362,00016,027,648
5Aug 17, 2026 18:351,649256,231,302238,005,0009,474,00016,027,648
6Aug 17, 2026 18:351,649255,895,180238,116,0009,376,00016,027,648
7Aug 17, 2026 18:351,650255,992,136238,094,0009,442,00016,031,744
8Aug 17, 2026 18:351,651256,035,173238,345,0009,386,00016,027,648
9Aug 17, 2026 18:351,654256,622,755238,881,0009,338,00016,027,648