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 listJul 29, 2026 17:57anboto1anboto1Score: 2,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 17:572,864439,648,598420,997,0008,661,00016,793,600
2Jul 29, 2026 17:572,865439,717,999421,178,0008,696,00016,793,600
3Jul 29, 2026 17:572,866440,128,214421,257,0008,670,00016,793,600
4Jul 29, 2026 17:572,867440,109,276421,479,0008,669,00016,793,600
5Jul 29, 2026 17:572,868440,209,764421,667,0008,649,00016,793,600
6Jul 29, 2026 17:572,869440,467,209421,805,0008,649,00016,793,600
7Jul 29, 2026 17:572,869440,481,104421,708,0008,772,00016,793,600
8Jul 29, 2026 17:572,872440,899,517422,142,0008,786,00016,793,600
9Jul 29, 2026 17:572,876441,536,923422,712,0008,768,00016,793,600