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 listOct 21, 2026 04:07e1011e1011Score: 18,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 04:0818,0412,717,238,5342,684,292,00021,878,00016,793,600
2Oct 21, 2026 04:0818,0572,719,727,8262,685,931,00022,761,00016,793,600
3Oct 21, 2026 04:0818,0772,722,454,6062,689,935,00021,671,00016,793,600
4Oct 21, 2026 04:0818,0892,724,254,8372,690,700,00022,760,00016,793,600
5Oct 21, 2026 04:0818,1142,728,369,2322,694,266,00022,894,00016,793,600
6Oct 21, 2026 04:0818,2082,742,040,9122,708,970,00022,236,00016,793,600
7Oct 21, 2026 04:0818,2242,744,504,7322,711,557,00022,049,00016,793,600
8Oct 21, 2026 04:0818,2552,749,184,3772,714,561,00023,760,00016,793,600
9Oct 21, 2026 04:0818,3042,756,583,1552,723,152,00022,537,00016,793,600