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 19:40Yuriy LyfenkoYuriy LyfenkoScore: 4,265Success
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 19:404,253660,711,035612,008,00025,957,00017,084,416
2Apr 1, 2023 19:404,255667,561,324611,343,00026,971,00017,006,592
3Apr 1, 2023 19:404,258726,240,877638,744,481016,945,152
4Apr 1, 2023 19:404,259663,826,778612,826,00025,950,00016,961,536
5Apr 1, 2023 19:404,262702,853,056639,306,253016,941,056
6Apr 1, 2023 19:404,263668,007,621612,512,00026,978,00016,990,208
7Apr 1, 2023 19:404,265665,638,241613,859,00025,951,00016,957,440
8Apr 1, 2023 19:404,271695,713,152640,679,736016,936,960
9Apr 1, 2023 19:404,271670,010,121612,744,00027,942,00017,219,584
10Apr 1, 2023 19:404,292670,294,089616,819,00026,948,00017,190,912
11Apr 1, 2023 19:404,294671,619,790613,162,00030,957,00017,006,592
12Apr 1, 2023 19:404,305667,203,807613,878,00031,941,00017,084,416