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:36anboto1anboto1Score: 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:373,098473,877,212439,762,00025,019,00016,793,600
2Jun 24, 2026 14:373,099474,051,345439,309,00025,566,00016,793,600
3Jun 24, 2026 14:373,102474,444,572439,820,00025,516,00016,793,600
4Jun 24, 2026 14:373,104474,921,078439,164,00026,507,00016,793,600
5Jun 24, 2026 14:373,104475,109,576440,213,00025,474,00016,793,600
6Jun 24, 2026 14:373,108475,443,790440,399,00025,874,00016,793,600
7Jun 24, 2026 14:373,109475,702,975441,507,00024,987,00016,793,600
8Jun 24, 2026 14:373,109475,510,644440,972,00025,438,00016,793,600
9Jun 24, 2026 14:373,111475,832,152440,736,00026,023,00016,793,600