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 14:33Huy Duc LeHuy Duc LeScore: 2,988Success
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 14:332,981474,435,387418,095,00029,006,00016,969,728
2Oct 31, 2025 14:332,982473,739,543418,257,00029,017,00017,158,144
3Oct 31, 2025 14:332,983478,716,161423,425,00023,967,00016,998,400
4Oct 31, 2025 14:332,986471,350,110417,858,00029,989,00016,977,920
5Oct 31, 2025 14:332,988471,503,634417,237,00031,017,00016,994,304
6Oct 31, 2025 14:332,991476,273,724423,739,00024,984,00017,080,320
7Oct 31, 2025 14:332,995480,115,520424,270,00025,015,00017,092,608
8Oct 31, 2025 14:332,996482,023,719420,412,00028,959,00017,072,128
9Oct 31, 2025 14:333,010477,598,810417,510,00033,960,00017,137,664