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 14:19anboto1anboto1Score: 3,225Success
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 14:203,178496,403,391452,625,00024,138,00016,793,600
2Jun 24, 2026 14:203,202498,324,467454,370,00026,014,00016,793,600
3Jun 24, 2026 14:203,218500,283,640457,642,00025,178,00016,797,696
4Jun 24, 2026 14:203,219501,579,496456,693,00026,214,00016,793,600
5Jun 24, 2026 14:203,225502,466,529457,881,00025,977,00016,797,696
6Jun 24, 2026 14:203,231503,961,553458,142,00026,640,00016,793,600
7Jun 24, 2026 14:203,234501,243,475458,548,00026,620,00016,793,600
8Jun 24, 2026 14:203,238503,161,909459,741,00025,973,00016,793,600
9Jun 24, 2026 14:203,239505,478,481459,663,00026,302,00016,793,600