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 7, 2024 03:09Huy Duc LeHuy Duc LeScore: 3,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 03:092,946497,344,060441,906,748016,961,536
2Mar 7, 2024 03:092,947497,220,959442,053,983016,973,824
3Mar 7, 2024 03:092,947496,173,795442,092,301016,961,536
4Mar 7, 2024 03:092,993475,976,842417,963,00030,997,00017,190,912
5Mar 7, 2024 03:092,995480,818,272417,195,00032,015,00017,018,880
6Mar 7, 2024 03:092,997478,259,255417,594,00031,968,00016,953,344
7Mar 7, 2024 03:093,003478,592,665420,502,00029,964,00017,035,264
8Mar 7, 2024 03:093,003477,684,688410,539,00039,955,00017,215,488
9Mar 7, 2024 03:093,005478,181,218417,772,00032,982,00017,137,664
10Mar 7, 2024 03:093,006473,131,168429,864,00020,993,00017,186,816
11Mar 7, 2024 03:093,007475,198,921423,104,00028,006,00016,953,344
12Mar 7, 2024 03:093,009480,546,596418,406,00032,953,00017,162,240