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:40Yurkov AlekseyYurkov AlekseyScore: 4,123Success
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:404,116643,583,858608,429,0008,991,00017,154,048
2Mar 24, 2023 23:404,117639,470,322603,597,00013,990,00017,125,376
3Mar 24, 2023 23:404,117639,725,448604,598,00012,991,00017,158,144
4Mar 24, 2023 23:404,120645,865,975607,010,00011,000,00017,096,704
5Mar 24, 2023 23:404,121645,445,997606,237,00011,984,00017,149,952
6Mar 24, 2023 23:404,123645,194,843606,410,00011,988,00017,145,856
7Mar 24, 2023 23:404,123655,314,702607,431,00010,989,00017,145,856
8Mar 24, 2023 23:404,124681,058,887618,604,503016,953,344
9Mar 24, 2023 23:404,124642,014,604602,564,00015,988,00017,211,392
10Mar 24, 2023 23:404,124640,712,959604,632,00013,991,00017,149,952
11Mar 24, 2023 23:404,127674,142,548619,056,069016,949,248
12Mar 24, 2023 23:404,129695,651,637619,365,615016,945,152