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 12:48anboto1anboto1Score: 3,125Success
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 12:493,114476,537,392442,184,00025,034,00016,793,600
2Jun 24, 2026 12:493,117476,854,842442,232,00025,386,00016,793,600
3Jun 24, 2026 12:493,121477,400,436442,778,00025,388,00016,793,600
4Jun 24, 2026 12:493,124477,862,983443,582,00025,113,00016,793,600
5Jun 24, 2026 12:493,125478,267,469443,282,00025,569,00016,793,600
6Jun 24, 2026 12:493,128478,357,096443,456,00025,772,00016,793,600
7Jun 24, 2026 12:493,132478,929,273444,373,00025,480,00016,793,600
8Jun 24, 2026 12:493,134479,454,105445,228,00024,995,00016,793,600
9Jun 24, 2026 12:493,139479,976,352445,714,00025,161,00016,793,600