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 listAug 25, 2026 13:19Navneet RajNavneet RajScore: 3,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 13:193,906596,662,690579,627,0006,369,00016,793,600
2Aug 25, 2026 13:193,907597,081,083579,717,0006,366,00016,793,600
3Aug 25, 2026 13:193,907595,935,281579,783,0006,287,00016,793,600
4Aug 25, 2026 13:193,908596,266,146579,837,0006,507,00016,793,600
5Aug 25, 2026 13:193,908596,128,902579,957,0006,339,00016,793,600
6Aug 25, 2026 13:193,909596,304,408580,098,0006,381,00016,793,600
7Aug 25, 2026 13:193,909596,119,335580,084,0006,316,00016,793,600
8Aug 25, 2026 13:193,911596,608,452580,219,0006,473,00016,793,600
9Aug 25, 2026 13:193,917597,501,862581,359,0006,209,00016,793,600