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:11Andrew EpsteinAndrew EpsteinScore: 23,029Success
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 14:1223,0103,462,008,7703,360,561,00090,953,00016,801,792stderr
2Sep 21, 2026 14:1223,0113,462,423,7763,360,929,00090,726,00016,801,792stderr
3Sep 21, 2026 14:1223,0133,463,003,6163,361,187,00090,763,00016,801,792stderr
4Sep 21, 2026 14:1223,0293,464,874,7523,362,255,00092,102,00016,801,792stderr
5Sep 21, 2026 14:1223,0293,464,904,2633,363,399,00091,028,00016,801,792stderr
6Sep 21, 2026 14:1223,0333,466,057,6153,364,460,00090,592,00016,801,792stderr
7Sep 21, 2026 14:1223,0693,470,826,5653,369,299,00091,086,00016,801,792stderr
8Sep 21, 2026 14:1223,0903,474,156,5113,372,443,00091,145,00016,801,792stderr
9Sep 21, 2026 14:1223,1023,477,733,9123,374,388,00091,039,00016,801,792stderr