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 19:11Yuriy LyfenkoYuriy LyfenkoScore: 4,206Success
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 19:114,1521,689,486,049622,792,371016,932,864
2Apr 1, 2023 19:114,1531,689,938,715622,913,187016,936,960
3Apr 1, 2023 19:114,1541,690,157,234623,133,513016,941,056
4Apr 1, 2023 19:114,1731,653,439,999599,968,00025,955,00017,096,704
5Apr 1, 2023 19:114,2011,653,324,697603,123,00026,960,00017,100,800
6Apr 1, 2023 19:114,2041,652,170,841606,547,00024,021,00017,096,704
7Apr 1, 2023 19:114,2061,662,024,025608,869,00021,959,00017,100,800
8Apr 1, 2023 19:114,2121,657,924,208605,815,00025,949,00017,100,800
9Apr 1, 2023 19:114,2151,660,153,209607,345,00024,973,00016,957,440
10Apr 1, 2023 19:114,2161,656,098,248609,449,00022,979,00017,096,704
11Apr 1, 2023 19:114,2211,660,749,589607,230,00025,967,00017,100,800
12Apr 1, 2023 19:114,2661,667,636,191612,948,00026,953,00017,154,048