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 15:17Andrew EpsteinAndrew EpsteinScore: 28,510Success
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:1928,4864,283,267,3004,198,418,00074,524,00016,801,792stderr
2Sep 21, 2026 15:1928,4974,285,258,3644,199,353,00075,273,00016,801,792stderr
3Sep 21, 2026 15:1928,5054,286,443,1004,200,781,00074,994,00016,801,792stderr
4Sep 21, 2026 15:1928,5074,286,855,5474,200,466,00075,632,00016,801,792stderr
5Sep 21, 2026 15:1928,5104,287,565,2954,202,385,00074,187,00016,801,792stderr
6Sep 21, 2026 15:1928,5164,287,942,2674,203,319,00074,190,00016,801,792stderr
7Sep 21, 2026 15:1928,5214,289,825,2884,203,754,00074,477,00016,801,792stderr
8Sep 21, 2026 15:1928,5434,291,816,7754,206,994,00074,515,00016,801,792stderr
9Sep 21, 2026 15:1928,5774,297,057,1434,212,100,00074,549,00016,801,792stderr