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 23:08Yurkov AlekseyYurkov AlekseyScore: 4,260Success
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 23:084,222658,920,183621,350,00011,987,00016,973,824
2Mar 24, 2023 23:084,224655,735,707619,642,00013,991,00016,961,536
3Mar 24, 2023 23:084,224653,610,315619,647,00013,992,00016,973,824
4Mar 24, 2023 23:084,224655,836,861618,654,00014,991,00016,973,824
5Mar 24, 2023 23:084,227658,814,037620,068,00014,001,00017,072,128
6Mar 24, 2023 23:084,240661,154,821621,029,00015,000,00017,154,048
7Mar 24, 2023 23:084,260699,444,749639,027,280016,941,056
8Mar 24, 2023 23:084,267698,496,220640,053,031016,945,152
9Mar 24, 2023 23:084,270667,837,745631,452,0008,992,00016,961,536
10Mar 24, 2023 23:084,289718,520,747643,354,175016,936,960
11Mar 24, 2023 23:084,322674,851,230637,298,00011,005,00016,973,824
12Mar 24, 2023 23:084,323677,548,656635,470,00012,989,00017,080,320