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 15:33anboto1anboto1Score: 3,169Success
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 15:333,161484,346,909462,660,00011,600,00016,793,600
2Jul 29, 2026 15:333,163484,590,798463,153,00011,373,00016,793,600
3Jul 29, 2026 15:333,163484,514,825463,188,00011,342,00016,793,600
4Jul 29, 2026 15:333,168485,280,690463,911,00011,307,00016,793,600
5Jul 29, 2026 15:333,169485,484,638464,089,00011,383,00016,793,600
6Jul 29, 2026 15:333,170485,628,633463,748,00011,881,00016,793,600
7Jul 29, 2026 15:333,177486,488,021465,033,00011,577,00016,793,600
8Jul 29, 2026 15:333,179486,913,387465,617,00011,267,00016,793,600
9Jul 29, 2026 15:333,196489,680,237467,664,00011,883,00016,793,600