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 21:09Yuriy LyfenkoYuriy LyfenkoScore: 3,955Success
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 21:093,921661,992,250588,215,409016,945,152
2Apr 1, 2023 21:093,922643,589,008588,290,346016,932,864
3Apr 1, 2023 21:093,922639,637,299588,350,757016,928,768
4Apr 1, 2023 21:093,952619,144,018568,806,00023,991,00016,957,440
5Apr 1, 2023 21:093,954620,185,031566,106,00027,005,00017,068,032
6Apr 1, 2023 21:093,955623,152,798565,259,00028,012,00017,031,168
7Apr 1, 2023 21:093,955625,549,412565,272,00028,013,00016,961,536
8Apr 1, 2023 21:093,957619,748,042570,521,00022,980,00017,031,168
9Apr 1, 2023 21:093,958617,133,712569,701,00023,987,00017,113,088
10Apr 1, 2023 21:093,958619,438,768568,735,00024,988,00017,195,008
11Apr 1, 2023 21:093,964625,642,290569,574,00024,981,00017,104,896
12Apr 1, 2023 21:093,972619,046,788569,811,00025,991,00016,957,440