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 listNov 20, 2025 00:50izotoffizotoffScore: 4,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 00:504,679726,536,301676,870,00024,958,00017,088,512
2Nov 20, 2025 00:504,687724,503,516675,105,00027,962,00016,961,536
3Nov 20, 2025 00:504,695732,821,805678,247,00025,971,00016,953,344
4Nov 20, 2025 00:504,711734,138,050681,676,00024,988,00016,961,536
5Nov 20, 2025 00:504,712733,969,055680,762,00025,990,00017,059,840
6Nov 20, 2025 00:504,740733,947,704683,069,00027,961,00017,080,320
7Nov 20, 2025 00:504,757740,037,268686,530,00026,981,00016,969,728
8Nov 20, 2025 00:504,780743,661,039689,967,00026,959,00017,133,568
9Nov 20, 2025 00:504,951777,641,999716,701,00025,952,00016,961,536