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 21:56anboto1anboto1Score: 2,964Success
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 21:562,959453,890,478428,949,00015,021,00016,793,600
2Jul 29, 2026 21:562,960454,163,732429,083,00015,011,00016,793,600
3Jul 29, 2026 21:562,963454,632,585429,519,00015,033,00016,793,600
4Jul 29, 2026 21:562,964454,605,134429,612,00015,092,00016,793,600
5Jul 29, 2026 21:562,964454,806,820429,427,00015,183,00016,793,600
6Jul 29, 2026 21:562,967454,917,100429,914,00015,147,00016,793,600
7Jul 29, 2026 21:562,967455,088,104429,970,00015,119,00016,793,600
8Jul 29, 2026 21:562,968455,176,763430,169,00015,131,00016,793,600
9Jul 29, 2026 21:562,968455,236,314430,363,00014,949,00016,793,600