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:09anboto1anboto1Score: 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 14:093,095474,856,748438,970,00025,378,00016,793,600
2Jun 24, 2026 14:093,099474,264,451439,184,00025,811,00016,793,600
3Jun 24, 2026 14:093,102474,592,918439,758,00025,604,00016,793,600
4Jun 24, 2026 14:093,103474,722,789439,952,00025,598,00016,793,600
5Jun 24, 2026 14:093,104474,891,226439,370,00026,272,00016,793,600
6Jun 24, 2026 14:093,105474,988,193441,360,00024,418,00016,793,600
7Jun 24, 2026 14:093,109475,465,257441,019,00025,352,00016,793,600
8Jun 24, 2026 14:093,112476,044,223440,672,00026,219,00016,793,600
9Jun 24, 2026 14:093,114476,314,474442,309,00024,841,00016,793,600