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,115Success
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:243,113477,157,220463,775,0003,239,00016,801,792stderr
2Aug 17, 2026 04:243,114477,066,306463,923,0003,195,00016,801,792stderr
3Aug 17, 2026 04:243,114477,104,859463,920,0003,186,00016,801,792stderr
4Aug 17, 2026 04:243,115477,212,406464,035,0003,225,00016,801,792stderr
5Aug 17, 2026 04:243,115477,285,019464,126,0003,194,00016,801,792stderr
6Aug 17, 2026 04:243,115477,344,209464,169,0003,209,00016,801,792stderr
7Aug 17, 2026 04:243,116477,459,254464,240,0003,161,00016,801,792stderr
8Aug 17, 2026 04:243,117477,551,885464,380,0003,172,00016,801,792stderr
9Aug 17, 2026 04:243,118478,708,181464,569,0003,208,00016,801,792stderr