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 24, 2023 16:06Yuriy LyfenkoYuriy LyfenkoScore: 4,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 16:064,265706,463,166639,687,037016,941,056
2Mar 24, 2023 16:064,275714,966,991641,317,616016,949,248
3Mar 24, 2023 16:064,290702,978,569643,490,500016,957,440
4Mar 24, 2023 16:064,431691,504,483637,675,00026,986,00016,953,344
5Mar 24, 2023 16:064,534708,076,143656,180,00023,970,00016,965,632
6Mar 24, 2023 16:064,547714,441,843656,123,00025,965,00017,088,512
7Mar 24, 2023 16:064,572712,804,633660,876,00024,957,00016,957,440
8Mar 24, 2023 16:064,573715,273,255656,938,00028,953,00016,973,824
9Mar 24, 2023 16:064,576717,170,897661,445,00024,979,00016,973,824
10Mar 24, 2023 16:064,582708,618,028660,365,00026,974,00017,203,200
11Mar 24, 2023 16:064,590714,710,984662,515,00025,981,00017,072,128
12Mar 24, 2023 16:064,627722,255,350668,039,00025,962,00016,973,824