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 listSep 21, 2026 15:40Andrew EpsteinAndrew EpsteinScore: 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
1Sep 21, 2026 15:401,633255,392,734240,269,0004,692,00016,793,600
2Sep 21, 2026 15:401,634255,615,064240,355,0004,771,00016,793,600
3Sep 21, 2026 15:401,635255,871,947240,599,0004,767,00016,793,600
4Sep 21, 2026 15:401,635256,236,187240,635,0004,713,00016,793,600
5Sep 21, 2026 15:401,636256,687,958240,726,0004,732,00016,793,600
6Sep 21, 2026 15:401,636256,560,167240,637,0004,770,00016,793,600
7Sep 21, 2026 15:401,636255,958,871240,618,0004,832,00016,793,600
8Sep 21, 2026 15:401,638256,112,604240,981,0004,765,00016,793,600
9Sep 21, 2026 15:401,638256,998,405241,056,0004,782,00016,793,600