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:29Yuriy LyfenkoYuriy LyfenkoScore: 4,513Success
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:294,255716,609,973638,260,773016,945,152
2Mar 24, 2023 16:294,273697,616,512640,922,447016,945,152
3Mar 24, 2023 16:294,277706,190,926641,557,837016,936,960
4Mar 24, 2023 16:294,362682,881,782628,314,00025,971,00017,022,976
5Mar 24, 2023 16:294,395688,419,469635,251,00023,971,00016,957,440
6Mar 24, 2023 16:294,492699,893,459647,885,00025,955,00017,055,744
7Mar 24, 2023 16:294,513701,861,353652,049,00024,963,00016,957,440
8Mar 24, 2023 16:294,543709,307,486658,432,00022,980,00016,957,440
9Mar 24, 2023 16:294,577715,337,418658,521,00027,979,00016,957,440
10Mar 24, 2023 16:294,590715,854,314662,489,00025,979,00016,969,728
11Mar 24, 2023 16:294,590719,575,231662,531,00025,981,00016,957,440
12Mar 24, 2023 16:294,599714,069,575664,823,00024,993,00016,969,728