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 11, 2026 08:01Tomislav TunkovicTomislav TunkovicScore: 2,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 08:022,126329,255,626302,931,00016,046,00016,801,792stderr
2Aug 11, 2026 08:022,126329,987,125302,923,00016,096,00016,801,792stderr
3Aug 11, 2026 08:022,126329,771,238303,017,00016,004,00016,801,792stderr
4Aug 11, 2026 08:022,127329,120,343302,995,00016,087,00016,801,792stderr
5Aug 11, 2026 08:022,128330,141,698303,149,00016,178,00016,801,792stderr
6Aug 11, 2026 08:022,128329,171,745303,263,00015,963,00016,801,792stderr
7Aug 11, 2026 08:022,131329,765,187303,525,00016,243,00016,801,792stderr
8Aug 11, 2026 08:022,132329,942,210303,756,00016,145,00016,801,792stderr
9Aug 11, 2026 08:022,132330,772,910303,570,00016,353,00016,801,792stderr