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 24, 2023 22:57Yuriy LyfenkoYuriy LyfenkoScore: 4,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 22:574,285715,496,881642,810,354016,941,056
2Mar 24, 2023 22:574,287708,053,292643,031,497016,945,152
3Mar 24, 2023 22:574,292699,942,513643,737,396016,945,152
4Mar 24, 2023 22:574,310674,941,006624,493,00021,982,00017,203,200
5Mar 24, 2023 22:574,314674,928,805621,173,00025,965,00017,190,912
6Mar 24, 2023 22:574,315672,706,900620,227,00026,966,00017,170,432
7Mar 24, 2023 22:574,316677,956,777621,365,00025,973,00017,051,648
8Mar 24, 2023 22:574,316671,444,621621,475,00025,978,00017,195,008
9Mar 24, 2023 22:574,318676,285,788624,642,00022,986,00016,969,728
10Mar 24, 2023 22:574,321675,529,927621,140,00026,962,00016,961,536
11Mar 24, 2023 22:574,324672,059,199623,664,00024,986,00017,203,200
12Mar 24, 2023 22:574,330677,743,960625,519,00023,981,00016,982,016