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 21, 2026 16:30Andrew EpsteinAndrew EpsteinScore: 1,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 16:311,610251,003,885237,453,0004,143,00016,793,600
2Sep 21, 2026 16:311,610250,970,796237,228,0004,341,00016,793,600
3Sep 21, 2026 16:311,610250,960,373237,245,0004,274,00016,793,600
4Sep 21, 2026 16:311,610250,401,495237,379,0004,200,00016,793,600
5Sep 21, 2026 16:311,611251,251,330237,330,0004,369,00016,793,600
6Sep 21, 2026 16:311,611251,063,946237,296,0004,358,00016,793,600
7Sep 21, 2026 16:311,613250,890,030237,986,0004,106,00016,793,600
8Sep 21, 2026 16:311,614251,439,015238,033,0004,075,00016,793,600
9Sep 21, 2026 16:311,614251,055,773238,054,0004,079,00016,793,600