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 15:10Yuriy LyfenkoYuriy LyfenkoScore: 4,231Success
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 15:104,181691,760,303627,179,428016,945,152
2Apr 1, 2023 15:104,184695,060,890627,546,649016,936,960
3Apr 1, 2023 15:104,184647,704,380602,552,00024,981,00017,010,688
4Apr 1, 2023 15:104,185685,734,507627,684,363016,945,152
5Apr 1, 2023 15:104,205667,532,433607,696,00022,988,00016,949,248
6Apr 1, 2023 15:104,222655,515,718612,339,00020,977,00017,121,280
7Apr 1, 2023 15:104,231657,984,159606,595,00027,981,00017,113,088
8Apr 1, 2023 15:104,231664,568,030608,601,00025,982,00017,014,784
9Apr 1, 2023 15:104,232663,070,423609,852,00024,993,00017,051,648
10Apr 1, 2023 15:104,238666,513,388609,699,00025,987,00016,957,440
11Apr 1, 2023 15:104,241660,331,734607,171,00028,960,00017,203,200
12Apr 1, 2023 15:104,275664,429,980614,306,00026,969,00016,969,728