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:55e1011e1011Score: 16,270Success
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 03:5716,2532,448,983,7492,421,234,00016,727,00016,793,600
2Oct 21, 2026 03:5716,2622,450,256,2682,422,719,00016,691,00016,793,600
3Oct 21, 2026 03:5716,2622,451,762,5122,422,818,00016,622,00016,793,600
4Oct 21, 2026 03:5716,2672,451,167,2252,423,365,00016,729,00016,793,600
5Oct 21, 2026 03:5716,2702,451,519,4792,423,939,00016,687,00016,793,600
6Oct 21, 2026 03:5716,2702,451,526,3022,423,883,00016,632,00016,793,600
7Oct 21, 2026 03:5716,2732,452,117,1712,424,401,00016,563,00016,793,600
8Oct 21, 2026 03:5716,2762,452,419,3572,424,898,00016,619,00016,793,600
9Oct 21, 2026 03:5716,2802,452,919,3002,425,402,00016,652,00016,793,600