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:45e1011e1011Score: 23,356Success
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:4623,3393,511,803,2103,481,862,00019,108,00016,793,600
2Oct 21, 2026 03:4623,3493,513,414,2353,483,341,00019,074,00016,793,600
3Oct 21, 2026 03:4623,3543,514,142,9933,484,239,00018,991,00016,793,600
4Oct 21, 2026 03:4623,3553,514,732,9143,484,541,00018,841,00016,793,600
5Oct 21, 2026 03:4623,3563,514,710,6833,484,070,00019,359,00016,793,600
6Oct 21, 2026 03:4623,7623,575,817,6963,543,686,00020,700,00016,793,600
7Oct 21, 2026 03:4623,7743,577,092,0083,545,678,00020,425,00016,793,600
8Oct 21, 2026 03:4623,7763,577,425,2483,546,033,00020,411,00016,793,600
9Oct 21, 2026 03:4623,8123,582,758,1493,551,369,00020,438,00016,793,600