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 17, 2026 03:48marko1597marko1597Score: 3,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:143,112476,973,062463,580,0003,355,00016,801,792stderr
2Aug 17, 2026 04:143,113476,919,688463,780,0003,173,00016,801,792stderr
3Aug 17, 2026 04:143,113477,023,580463,855,0003,188,00016,801,792stderr
4Aug 17, 2026 04:143,114477,110,773463,907,0003,256,00016,801,792stderr
5Aug 17, 2026 04:143,114477,145,639463,932,0003,214,00016,801,792stderr
6Aug 17, 2026 04:143,114477,113,390463,978,0003,187,00016,801,792stderr
7Aug 17, 2026 04:143,118477,852,205464,592,0003,221,00016,801,792stderr
8Aug 17, 2026 04:143,121478,205,905464,977,0003,220,00016,801,792stderr
9Aug 17, 2026 04:143,167496,991,615471,907,0003,174,00016,801,792stderr