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 listJun 24, 2026 11:07anboto1anboto1Score: 24,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:0823,6473,556,467,0303,526,662,00020,489,00016,793,600
2Jun 24, 2026 11:0823,6523,557,405,3943,526,697,00021,198,00016,793,600
3Jun 24, 2026 11:0823,7503,571,747,2763,542,260,00020,331,00016,793,600
4Jun 24, 2026 11:0823,9413,600,493,0243,570,416,00020,770,00016,793,600
5Jun 24, 2026 11:0824,0323,614,049,7563,584,399,00020,466,00016,793,600
6Jun 24, 2026 11:0824,0343,614,452,1603,584,426,00020,748,00016,793,600
7Jun 24, 2026 11:0824,1183,626,966,3353,597,674,00020,119,00016,793,600
8Jun 24, 2026 11:0826,4233,973,103,4133,941,815,00021,635,00016,793,600
9Jun 24, 2026 11:0826,7834,026,777,4233,995,664,00021,823,00016,793,600