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 19, 2026 15:35Victor MerckléVictor MerckléScore: 1,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:371,634255,098,659237,350,0007,845,00016,801,792stderr
2Aug 19, 2026 15:371,635255,274,844237,444,0007,881,00016,801,792stderr
3Aug 19, 2026 15:371,635255,403,445237,312,0007,950,00016,801,792stderr
4Aug 19, 2026 15:371,636256,893,319237,477,0007,965,00016,801,792stderr
5Aug 19, 2026 15:371,636255,355,909237,423,0007,984,00016,801,792stderr
6Aug 19, 2026 15:371,636256,158,330237,533,0007,969,00016,801,792stderr
7Aug 19, 2026 15:371,639255,708,612237,904,0007,978,00016,801,792stderr
8Aug 19, 2026 15:371,639255,804,167237,954,0007,974,00016,801,792stderr
9Aug 19, 2026 15:371,640256,677,626238,112,0007,965,00016,801,792stderr