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 16:50anboto1anboto1Score: 3,380Success
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 16:503,355513,884,763491,517,00011,733,00016,793,600
2Jul 29, 2026 16:503,362514,480,572492,777,00011,660,00016,793,600
3Jul 29, 2026 16:503,362514,362,631492,536,00011,764,00016,793,600
4Jul 29, 2026 16:503,380517,407,305494,897,00012,202,00016,793,600
5Jul 29, 2026 16:503,380517,208,055494,749,00012,361,00016,793,600
6Jul 29, 2026 16:503,382517,575,214494,756,00012,667,00016,793,600
7Jul 29, 2026 16:503,383517,669,689495,127,00012,347,00016,793,600
8Jul 29, 2026 16:503,384517,614,686495,422,00012,223,00016,793,600
9Jul 29, 2026 16:503,390518,805,782496,302,00012,253,00016,793,600