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 14:58Andrew EpsteinAndrew EpsteinScore: 13,483Success
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 15:0013,4772,032,277,5761,975,034,00046,639,00016,801,792stderr
2Sep 21, 2026 15:0013,4812,032,853,1661,976,228,00046,051,00016,801,792stderr
3Sep 21, 2026 15:0013,4812,033,477,0171,975,632,00046,628,00016,797,696stderr
4Sep 21, 2026 15:0013,4832,033,053,5801,975,686,00046,787,00016,801,792stderr
5Sep 21, 2026 15:0013,4832,033,811,6651,976,082,00046,517,00016,797,696stderr
6Sep 21, 2026 15:0013,4862,033,559,5101,975,777,00047,142,00016,801,792stderr
7Sep 21, 2026 15:0013,5032,036,687,6281,978,781,00046,698,00016,801,792stderr
8Sep 21, 2026 15:0013,5072,036,631,5611,979,456,00046,638,00016,801,792stderr
9Sep 21, 2026 15:0013,5072,036,956,0131,979,754,00046,332,00016,801,792stderr