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 13, 2026 13:47Tomislav TunkovicTomislav TunkovicScore: 1,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 13:481,841286,357,992265,596,00010,600,00016,801,792stderr
2Aug 13, 2026 13:481,841286,286,761265,673,00010,558,00016,801,792stderr
3Aug 13, 2026 13:481,842287,307,381265,795,00010,567,00016,801,792stderr
4Aug 13, 2026 13:481,843286,506,168265,889,00010,563,00016,801,792stderr
5Aug 13, 2026 13:481,844287,377,433265,995,00010,611,00016,801,792stderr
6Aug 13, 2026 13:481,845287,555,427266,204,00010,619,00016,801,792stderr
7Aug 13, 2026 13:481,846287,605,674266,242,00010,706,00016,801,792stderr
8Aug 13, 2026 13:481,847287,029,844266,499,00010,594,00016,801,792stderr
9Aug 13, 2026 13:481,849288,105,819266,671,00010,724,00016,801,792stderr