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 9, 2026 07:58Karthik ReddyKarthik ReddyScore: 1,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:591,554242,004,704229,052,0004,189,00016,793,600
2Oct 9, 2026 07:591,555242,235,424229,166,0004,215,00016,793,600
3Oct 9, 2026 07:591,558242,547,909229,518,0004,224,00016,793,600
4Oct 9, 2026 07:591,558242,588,884229,603,0004,237,00016,793,600
5Oct 9, 2026 07:591,561245,272,676229,904,0004,264,00016,793,600
6Oct 9, 2026 07:591,562243,012,398229,966,0004,407,00016,793,600
7Oct 9, 2026 07:591,566243,670,463230,666,0004,253,00016,793,600
8Oct 9, 2026 07:591,571244,886,787231,468,0004,256,00016,793,600
9Oct 9, 2026 07:591,572245,521,423231,688,0004,241,00016,793,600