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 listNov 4, 2026 01:26Andrew EpsteinAndrew EpsteinScore: 15,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 01:2715,6092,350,844,7542,303,507,00037,843,00016,801,792stderr
2Nov 4, 2026 01:2715,6122,351,341,5552,303,935,00037,923,00016,801,792stderr
3Nov 4, 2026 01:2715,6122,351,339,3852,303,963,00037,907,00016,801,792stderr
4Nov 4, 2026 01:2715,6142,351,563,4192,304,016,00038,107,00016,801,792stderr
5Nov 4, 2026 01:2715,6142,352,353,0972,303,976,00038,263,00016,801,792stderr
6Nov 4, 2026 01:2715,6162,351,971,6852,304,431,00038,086,00016,801,792stderr
7Nov 4, 2026 01:2715,6462,356,319,5282,308,551,00038,373,00016,801,792stderr
8Nov 4, 2026 01:2715,6482,356,686,1872,308,712,00038,546,00016,801,792stderr
9Nov 4, 2026 01:2715,6512,357,153,2012,309,439,00038,260,00016,801,792stderr