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 04:12Yuriy LyfenkoYuriy LyfenkoScore: 4,545Success
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 04:124,317700,450,413647,505,709016,961,536
2Mar 21, 2023 04:124,331713,455,926649,609,361016,957,440
3Mar 21, 2023 04:124,339712,211,625650,858,820016,941,056
4Mar 21, 2023 04:124,430685,898,757642,499,00021,982,00016,957,440
5Mar 21, 2023 04:124,463699,675,209641,429,00027,975,00017,158,144
6Mar 21, 2023 04:124,489695,717,344647,390,00025,975,00016,973,824
7Mar 21, 2023 04:124,545706,240,910656,745,00024,990,00017,084,416
8Mar 21, 2023 04:124,561711,817,240659,134,00024,967,00016,957,440
9Mar 21, 2023 04:124,617718,702,243666,566,00025,983,00017,072,128
10Mar 21, 2023 04:124,635723,277,067669,331,00025,974,00017,059,840
11Mar 21, 2023 04:124,642723,046,783670,384,00025,976,00017,068,032
12Mar 21, 2023 04:124,645724,143,314669,721,00026,988,00017,080,320