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 listApr 1, 2023 19:58Yuriy LyfenkoYuriy LyfenkoScore: 4,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 19:584,165655,736,531598,742,00025,945,00016,973,824
2Apr 1, 2023 19:584,187651,643,267602,152,00025,963,00016,961,536
3Apr 1, 2023 19:584,204655,154,067604,588,00025,982,00017,113,088
4Apr 1, 2023 19:584,211659,289,706608,606,00022,985,00016,957,440
5Apr 1, 2023 19:584,211653,900,371604,612,00026,982,00016,969,728
6Apr 1, 2023 19:584,211652,357,873606,696,00024,987,00016,961,536
7Apr 1, 2023 19:584,218656,087,454607,782,00024,991,00017,055,744
8Apr 1, 2023 19:584,275667,149,115614,263,00026,967,00017,145,856
9Apr 1, 2023 19:584,280663,317,663614,090,00027,958,00017,031,168
10Apr 1, 2023 19:584,571757,322,528685,618,755016,936,960
11Apr 1, 2023 19:584,573740,931,830685,885,947016,936,960
12Apr 1, 2023 19:584,580764,478,220686,998,848016,936,960