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 listSep 15, 2026 15:52Haha ExpertHaha ExpertScore: 5,058Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 15:535,047767,468,443747,624,0009,532,00016,793,600
2Sep 15, 2026 15:535,051768,023,741748,410,0009,361,00016,793,600
3Sep 15, 2026 15:535,053768,351,202748,530,0009,485,00016,793,600
4Sep 15, 2026 15:535,058770,513,071749,310,0009,469,00016,793,600
5Sep 15, 2026 15:535,058769,067,031749,352,0009,410,00016,793,600
6Sep 15, 2026 15:535,060769,475,074749,724,0009,409,00016,793,600
7Sep 15, 2026 15:535,069770,777,119750,045,00010,394,00016,793,600
8Sep 15, 2026 15:535,070770,837,612751,112,0009,431,00016,793,600
9Sep 15, 2026 15:535,070770,922,709751,196,0009,440,00016,793,600