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:16Andrew EpsteinAndrew EpsteinScore: 1,637Success
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:161,636256,708,760238,139,0007,400,00016,793,600
2Sep 21, 2026 15:161,636256,584,159238,073,0007,368,00016,793,600
3Sep 21, 2026 15:161,636255,818,079238,034,0007,385,00016,793,600
4Sep 21, 2026 15:161,637256,021,608238,155,0007,415,00016,793,600
5Sep 21, 2026 15:161,637256,064,795238,153,0007,421,00016,793,600
6Sep 21, 2026 15:161,637256,053,632238,178,0007,395,00016,793,600
7Sep 21, 2026 15:161,639256,506,658238,507,0007,476,00016,793,600
8Sep 21, 2026 15:161,640257,183,837238,584,0007,490,00016,793,600
9Sep 21, 2026 15:161,640256,525,981238,611,0007,483,00016,793,600