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 16:58anboto1anboto1Score: 2,799Success
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 16:582,795429,265,805404,707,00014,586,00016,793,600
2Jul 29, 2026 16:582,796429,569,843404,954,00014,461,00016,793,600
3Jul 29, 2026 16:582,797429,745,376405,106,00014,516,00016,793,600
4Jul 29, 2026 16:582,798429,996,657405,193,00014,618,00016,793,600
5Jul 29, 2026 16:582,799430,595,963405,454,00014,495,00016,793,600
6Jul 29, 2026 16:582,800430,049,272405,525,00014,489,00016,793,600
7Jul 29, 2026 16:582,803430,563,329406,018,00014,552,00016,793,600
8Jul 29, 2026 16:582,803430,571,901405,825,00014,715,00016,793,600
9Jul 29, 2026 16:582,806430,929,659406,342,00014,678,00016,793,600