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 2, 2026 10:50A_ShamanA_ShamanScore: 3,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 2, 2026 10:513,960603,469,008572,195,00021,826,00016,793,600
2Jul 2, 2026 10:513,962603,717,855572,058,00022,268,00016,793,600
3Jul 2, 2026 10:513,963603,963,955572,527,00022,024,00016,793,600
4Jul 2, 2026 10:513,963603,950,379572,472,00022,039,00016,793,600
5Jul 2, 2026 10:513,964604,199,183572,333,00022,393,00016,793,600
6Jul 2, 2026 10:513,968604,754,693573,253,00022,072,00016,793,600
7Jul 2, 2026 10:513,972606,602,921573,609,00022,305,00016,793,600
8Jul 2, 2026 10:513,983606,988,984574,492,00023,051,00016,793,600
9Jul 2, 2026 10:513,989607,769,193575,309,00023,061,00016,793,600