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 21:10Yuriy LyfenkoYuriy LyfenkoScore: 3,946Success
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 21:103,924646,524,708588,526,226016,945,152
2Apr 1, 2023 21:103,924666,017,817588,547,743016,936,960
3Apr 1, 2023 21:103,926656,193,664588,865,149016,936,960
4Apr 1, 2023 21:103,944612,441,004566,656,00024,984,00016,973,824
5Apr 1, 2023 21:103,945619,269,613568,709,00022,988,00016,957,440
6Apr 1, 2023 21:103,945617,965,629566,786,00024,990,00016,957,440
7Apr 1, 2023 21:103,946616,998,319567,919,00023,996,00017,100,800
8Apr 1, 2023 21:103,946614,322,480569,953,00021,998,00017,166,336
9Apr 1, 2023 21:103,946617,581,357568,975,00022,999,00017,076,224
10Apr 1, 2023 21:103,947617,166,759565,001,00027,000,00016,957,440
11Apr 1, 2023 21:103,948616,034,053568,192,00024,008,00016,969,728
12Apr 1, 2023 21:103,950617,252,258565,515,00026,976,00016,957,440