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 03:56e1011e1011Score: 16,236Success
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:0216,2252,444,614,1702,417,667,00016,122,00016,793,600
2Oct 21, 2026 04:0216,2302,445,404,1342,418,402,00016,139,00016,793,600
3Oct 21, 2026 04:0216,2332,446,643,2702,418,603,00016,362,00016,793,600
4Oct 21, 2026 04:0216,2352,446,144,7222,419,116,00016,209,00016,793,600
5Oct 21, 2026 04:0216,2362,446,827,6542,419,120,00016,419,00016,793,600
6Oct 21, 2026 04:0216,2372,446,376,3532,419,395,00016,168,00016,793,600
7Oct 21, 2026 04:0216,2402,447,047,8882,419,660,00016,343,00016,793,600
8Oct 21, 2026 04:0216,2432,447,562,6612,420,382,00016,152,00016,793,600
9Oct 21, 2026 04:0216,2452,449,080,0012,420,729,00016,152,00016,793,600