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:12Huy Duc LeHuy Duc LeScore: 2,999Success
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:122,986473,056,131414,900,00032,992,00017,027,072
2Oct 31, 2025 13:122,995476,472,568424,203,00025,012,00017,035,264
3Oct 31, 2025 13:122,996475,009,340421,497,00027,966,00017,018,880
4Oct 31, 2025 13:122,998472,328,930420,786,00028,985,00016,945,152
5Oct 31, 2025 13:122,999480,821,241413,869,00035,988,00017,158,144
6Oct 31, 2025 13:123,000479,122,727415,040,00035,003,00017,158,144
7Oct 31, 2025 13:123,002481,842,831424,409,00025,963,00017,010,688
8Oct 31, 2025 13:123,003477,971,255417,480,00032,958,00017,014,784
9Oct 31, 2025 13:123,027480,290,609423,025,00031,001,00017,014,784