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 21, 2023 05:01Yuriy LyfenkoYuriy LyfenkoScore: 4,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2023 05:014,307699,895,596646,090,092016,945,152
2Mar 21, 2023 05:014,362712,114,356654,300,016016,941,056
3Mar 21, 2023 05:014,391687,062,486634,631,00023,948,00017,137,664
4Mar 21, 2023 05:014,398690,203,733633,758,00025,949,00017,072,128
5Mar 21, 2023 05:014,414730,672,013662,154,149016,941,056
6Mar 21, 2023 05:014,481698,324,372644,222,00027,966,00017,006,592
7Mar 21, 2023 05:014,581720,639,495659,131,00027,963,00016,965,632
8Mar 21, 2023 05:014,593711,489,388662,984,00025,960,00017,018,880
9Mar 21, 2023 05:014,618720,126,935665,781,00026,991,00016,969,728
10Mar 21, 2023 05:014,619719,944,542665,834,00026,952,00017,051,648
11Mar 21, 2023 05:014,633719,739,987667,054,00027,960,00016,953,344
12Mar 21, 2023 05:014,653724,569,108675,048,00022,967,00017,133,568