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 listAug 27, 2026 12:35Victor MerckléVictor MerckléScore: 1,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 12:361,619253,552,458235,055,0007,914,00016,801,792stderr
2Aug 27, 2026 12:361,620253,052,897235,132,0007,993,00016,801,792stderr
3Aug 27, 2026 12:361,620253,708,649235,150,0007,918,00016,801,792stderr
4Aug 27, 2026 12:361,621253,765,492235,274,0007,960,00016,801,792stderr
5Aug 27, 2026 12:361,621253,170,018235,332,0007,935,00016,801,792stderr
6Aug 27, 2026 12:361,621253,716,035235,211,0007,957,00016,801,792stderr
7Aug 27, 2026 12:361,623253,405,083235,583,0007,962,00016,801,792stderr
8Aug 27, 2026 12:361,624253,633,291235,774,0007,965,00016,801,792stderr
9Aug 27, 2026 12:361,625253,649,654235,806,0007,967,00016,801,792stderr