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 listMay 14, 2026 16:53Josu San MartinJosu San MartinScore: 36,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 17:0635,7075,364,984,2175,327,737,00028,441,00016,809,984
2May 14, 2026 17:0636,0765,420,499,8655,383,149,00028,264,00016,809,984
3May 14, 2026 17:0636,0845,423,135,8485,382,745,00029,958,00016,846,848
4May 14, 2026 17:0636,1045,429,715,6285,385,118,00030,541,00016,846,848
5May 14, 2026 17:0636,1435,433,137,7345,390,449,00031,093,00016,809,984
6May 14, 2026 17:0636,1485,433,639,6785,391,166,00031,166,00016,809,984
7May 14, 2026 17:0636,1495,433,812,4365,393,387,00029,098,00016,809,984
8May 14, 2026 17:0636,3525,465,536,4305,425,289,00027,554,00016,809,984
9May 14, 2026 17:0636,3675,472,362,6435,427,498,00027,632,00016,809,984