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 14, 2026 09:39Haha ExpertHaha ExpertScore: 53,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 09:4153,5698,047,069,2457,987,443,00047,991,00016,793,600
2Sep 14, 2026 09:4153,5878,049,905,3537,992,551,00045,643,00016,793,600
3Sep 14, 2026 09:4153,6788,062,914,2698,005,337,00046,470,00016,793,600
4Sep 14, 2026 09:4153,7588,074,002,5528,017,783,00045,926,00016,793,600
5Sep 14, 2026 09:4153,8688,090,668,6018,034,608,00045,717,00016,793,600
6Sep 14, 2026 09:4154,0768,121,886,3358,066,185,00045,308,00016,793,600
7Sep 14, 2026 09:4154,2648,150,706,7768,101,466,00038,247,00016,793,600
8Sep 14, 2026 09:4154,2838,152,853,1628,103,340,00039,119,00016,793,600
9Sep 14, 2026 09:4154,3338,160,535,4578,111,522,00038,550,00016,793,600