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 listMar 6, 2024 07:20Huy Duc LeHuy Duc LeScore: 3,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 07:203,173528,608,359475,991,054016,986,112
2Mar 6, 2024 07:203,176531,873,090476,405,283016,994,304
3Mar 6, 2024 07:203,180536,692,385476,942,470016,990,208
4Mar 6, 2024 07:203,217510,517,097437,554,00044,954,00017,068,032
5Mar 6, 2024 07:203,220505,727,315441,022,00042,002,00017,092,608
6Mar 6, 2024 07:203,221506,077,396429,114,00054,014,00017,186,816
7Mar 6, 2024 07:203,222516,392,944438,209,00045,021,00016,961,536
8Mar 6, 2024 07:203,223508,604,490434,499,00048,943,00017,108,992
9Mar 6, 2024 07:203,223512,273,015436,522,00046,948,00017,084,416
10Mar 6, 2024 07:203,224506,822,700429,581,00053,947,00017,195,008
11Mar 6, 2024 07:203,225511,274,774440,772,00042,977,00016,998,400
12Mar 6, 2024 07:203,230509,179,188432,545,00051,945,00017,002,496