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:17anboto1anboto1Score: 3,553Success
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:173,476532,010,690499,243,00022,256,00016,793,600
2Jul 29, 2026 21:173,488533,261,067500,960,00022,240,00016,793,600
3Jul 29, 2026 21:173,494534,351,317502,038,00022,088,00016,793,600
4Jul 29, 2026 21:173,549542,444,116510,401,00021,972,00016,793,600
5Jul 29, 2026 21:173,553543,205,840511,089,00021,906,00016,793,600
6Jul 29, 2026 21:173,554543,202,334510,960,00022,226,00016,793,600
7Jul 29, 2026 21:173,556543,587,309511,320,00022,183,00016,793,600
8Jul 29, 2026 21:173,569545,351,934513,093,00022,332,00016,793,600
9Jul 29, 2026 21:173,593549,699,614517,339,00021,743,00016,793,600