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 19:11anboto1anboto1Score: 2,847Success
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 19:112,844436,647,175418,093,0008,648,00016,793,600
2Jul 29, 2026 19:112,845436,880,527418,034,0008,739,00016,793,600
3Jul 29, 2026 19:112,845437,400,469418,094,0008,695,00016,793,600
4Jul 29, 2026 19:112,846438,140,787418,300,0008,644,00016,793,600
5Jul 29, 2026 19:112,847437,135,697418,439,0008,682,00016,793,600
6Jul 29, 2026 19:112,847437,574,064418,480,0008,629,00016,793,600
7Jul 29, 2026 19:112,848437,290,593418,412,0008,875,00016,793,600
8Jul 29, 2026 19:112,849437,398,001418,689,0008,726,00016,793,600
9Jul 29, 2026 19:112,851437,597,295418,903,0008,755,00016,793,600