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, 2025 09:50AnSaAnSaScore: 4,138Success
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, 2025 09:504,127641,412,865603,041,00016,001,00017,031,168
2Oct 21, 2025 09:504,131642,022,115599,694,00019,989,00017,096,704
3Oct 21, 2025 09:504,135644,587,715601,208,00019,006,00017,190,912
4Oct 21, 2025 09:504,137647,448,659604,502,00015,986,00017,035,264
5Oct 21, 2025 09:504,138647,169,382604,732,00015,992,00017,035,264
6Oct 21, 2025 09:504,139644,213,421605,920,00014,998,00017,039,360
7Oct 21, 2025 09:504,142650,436,007606,254,00015,006,00016,957,440
8Oct 21, 2025 09:504,147649,211,407606,113,00016,002,00017,010,688
9Oct 21, 2025 09:504,154650,126,811607,066,00016,001,00017,039,360