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 22:19anboto1anboto1Score: 3,075Success
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 22:203,060469,008,895433,621,00025,387,00016,793,600
2Jul 29, 2026 22:203,061469,203,263433,285,00025,953,00016,793,600
3Jul 29, 2026 22:203,061469,141,918433,742,00025,422,00016,793,600
4Jul 29, 2026 22:203,064469,626,946434,153,00025,496,00016,793,600
5Jul 29, 2026 22:203,075471,403,573436,530,00024,770,00016,793,600
6Jul 29, 2026 22:203,082472,491,374437,264,00025,124,00016,793,600
7Jul 29, 2026 22:203,097474,623,609439,060,00025,613,00016,793,600
8Jul 29, 2026 22:203,120478,086,044441,987,00026,112,00016,793,600
9Jul 29, 2026 22:203,125478,803,653442,569,00026,271,00016,793,600