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 17:47Andrew EpsteinAndrew EpsteinScore: 1,577Success
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 17:481,576246,814,918232,158,0004,358,00016,793,600
2Sep 21, 2026 17:481,576245,422,946232,140,0004,370,00016,793,600
3Sep 21, 2026 17:481,576245,948,344232,220,0004,201,00016,793,600
4Sep 21, 2026 17:481,576245,942,484232,097,0004,394,00016,793,600
5Sep 21, 2026 17:481,577245,481,547232,336,0004,224,00016,793,600
6Sep 21, 2026 17:481,577246,060,619232,268,0004,360,00016,793,600
7Sep 21, 2026 17:481,580245,970,416232,992,0004,115,00016,793,600
8Sep 21, 2026 17:481,580246,540,161232,848,0004,257,00016,793,600
9Sep 21, 2026 17:481,580246,499,938232,813,0004,252,00016,793,600