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 05:08marko1597marko1597Score: 2,435Success
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 05:402,434375,983,066359,791,0005,389,00016,801,792stderr
2Aug 17, 2026 05:402,434375,127,469359,758,0005,360,00016,801,792stderr
3Aug 17, 2026 05:402,435376,550,058360,029,0005,306,00016,801,792stderr
4Aug 17, 2026 05:402,435375,270,810360,090,0005,248,00016,801,792stderr
5Aug 17, 2026 05:402,435375,396,761360,044,0005,343,00016,801,792stderr
6Aug 17, 2026 05:402,437375,687,818360,252,0005,373,00016,801,792stderr
7Aug 17, 2026 05:402,438375,764,795360,471,0005,324,00016,801,792stderr
8Aug 17, 2026 05:402,438377,024,268360,632,0005,200,00016,801,792stderr
9Aug 17, 2026 05:402,439375,904,772360,690,0005,249,00016,801,792stderr