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:07Yuriy LyfenkoYuriy LyfenkoScore: 4,487Success
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:074,262704,162,325639,327,044016,949,248
2Mar 24, 2023 16:074,275703,994,279641,271,620016,941,056
3Mar 24, 2023 16:074,277704,477,734641,572,476016,957,440
4Mar 24, 2023 16:074,345676,942,114625,801,00025,950,00016,977,920
5Mar 24, 2023 16:074,378683,972,170627,736,00028,941,00016,945,152
6Mar 24, 2023 16:074,471697,933,340647,671,00022,988,00017,117,184
7Mar 24, 2023 16:074,487699,927,985647,036,00025,961,00016,953,344
8Mar 24, 2023 16:074,550709,277,188655,513,00026,979,00016,957,440
9Mar 24, 2023 16:074,551712,704,081659,718,00022,990,00016,965,632
10Mar 24, 2023 16:074,610716,817,381663,505,00027,979,00017,084,416
11Mar 24, 2023 16:074,627722,083,234666,056,00027,960,00017,145,856
12Mar 24, 2023 16:074,672728,001,276676,774,00023,992,00016,957,440