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:34Haha ExpertHaha ExpertScore: 5,346Success
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:365,333810,283,830789,936,00010,028,00016,793,600
2Sep 15, 2026 15:365,334810,587,748790,195,00010,054,00016,793,600
3Sep 15, 2026 15:365,337810,914,496790,606,00010,072,00016,793,600
4Sep 15, 2026 15:365,341811,544,351791,166,00010,074,00016,793,600
5Sep 15, 2026 15:365,346812,346,073791,857,00010,121,00016,793,600
6Sep 15, 2026 15:365,348812,560,913792,235,00010,033,00016,793,600
7Sep 15, 2026 15:365,349812,729,358792,227,00010,187,00016,793,600
8Sep 15, 2026 15:365,349812,581,358792,290,00010,069,00016,793,600
9Sep 15, 2026 15:365,351812,987,824792,539,00010,149,00016,793,600