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 13:35Andrew EpsteinAndrew EpsteinScore: 8,961Success
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 13:368,9201,348,568,7511,254,068,00084,041,00016,805,888stderr
2Sep 21, 2026 13:368,9411,352,121,7761,260,095,00081,117,00016,809,984stderr
3Sep 21, 2026 13:368,9581,354,721,2001,262,714,00081,039,00016,809,984stderr
4Sep 21, 2026 13:368,9591,354,334,3641,262,811,00081,162,00016,805,888stderr
5Sep 21, 2026 13:368,9611,354,809,6811,258,673,00085,508,00016,805,888stderr
6Sep 21, 2026 13:368,9651,355,582,7471,263,150,00081,659,00016,805,888stderr
7Sep 21, 2026 13:368,9771,357,618,5221,265,298,00081,321,00016,805,888stderr
8Sep 21, 2026 13:368,9831,357,788,9961,263,309,00084,201,00016,805,888stderr
9Sep 21, 2026 13:369,0041,361,289,8731,269,400,00081,309,00016,805,888stderr