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 13:57anboto1anboto1Score: 3,104Success
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 13:573,089472,576,827438,336,00025,072,00016,793,600
2Jun 24, 2026 13:573,089473,043,343438,110,00025,283,00016,793,600
3Jun 24, 2026 13:573,091474,297,419438,556,00025,231,00016,793,600
4Jun 24, 2026 13:573,100474,267,346439,485,00025,629,00016,793,600
5Jun 24, 2026 13:573,104474,769,456439,706,00025,920,00016,793,600
6Jun 24, 2026 13:573,108475,498,854440,331,00025,957,00016,793,600
7Jun 24, 2026 13:573,112476,200,656441,478,00025,418,00016,793,600
8Jun 24, 2026 13:573,114476,285,297442,590,00024,530,00016,793,600
9Jun 24, 2026 13:573,115476,479,788441,715,00025,680,00016,793,600