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 31, 2025 13:50Huy Duc LeHuy Duc LeScore: 2,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2025 13:502,982478,192,150414,391,00032,951,00017,010,688
2Oct 31, 2025 13:502,983477,381,406418,425,00028,960,00017,207,296
3Oct 31, 2025 13:502,987469,460,763424,109,00024,006,00017,092,608
4Oct 31, 2025 13:502,990473,276,811419,512,00028,966,00016,994,304
5Oct 31, 2025 13:502,992473,947,346412,845,00035,986,00017,031,168
6Oct 31, 2025 13:502,993478,103,918422,962,00025,997,00017,113,088
7Oct 31, 2025 13:502,999475,032,060420,924,00028,994,00017,104,896
8Oct 31, 2025 13:503,000475,287,415422,050,00028,003,00016,994,304
9Oct 31, 2025 13:503,030478,111,084420,596,00033,967,00016,998,400