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 21:53anboto1anboto1Score: 3,188Success
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 21:543,185487,843,586462,748,00015,026,00016,793,600
2Jul 29, 2026 21:543,185487,839,385462,903,00014,933,00016,793,600
3Jul 29, 2026 21:543,187488,219,616463,011,00015,071,00016,793,600
4Jul 29, 2026 21:543,187488,162,315463,143,00014,980,00016,793,600
5Jul 29, 2026 21:543,188488,336,089463,240,00015,007,00016,793,600
6Jul 29, 2026 21:543,190489,207,146463,479,00015,083,00016,793,600
7Jul 29, 2026 21:543,190488,606,744463,458,00015,167,00016,793,600
8Jul 29, 2026 21:543,196489,510,209464,339,00015,187,00016,793,600
9Jul 29, 2026 21:543,227494,742,732468,959,00015,100,00016,793,600