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:40anboto1anboto1Score: 3,060Success
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:413,051468,293,101442,518,00015,280,00016,793,600
2Jul 29, 2026 22:413,057468,624,430443,353,00015,269,00016,793,600
3Jul 29, 2026 22:413,058468,622,312443,804,00014,932,00016,793,600
4Jul 29, 2026 22:413,058468,597,765443,767,00014,965,00016,793,600
5Jul 29, 2026 22:413,060468,996,572443,893,00015,128,00016,793,600
6Jul 29, 2026 22:413,063469,499,236444,175,00015,343,00016,793,600
7Jul 29, 2026 22:413,066470,051,122444,394,00015,507,00016,793,600
8Jul 29, 2026 22:413,066469,819,018444,673,00015,285,00016,793,600
9Jul 29, 2026 22:413,071470,771,315445,749,00015,012,00016,793,600