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:29Yuriy LyfenkoYuriy LyfenkoScore: 4,224Success
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:294,164683,937,470624,579,779016,936,960
2Apr 1, 2023 19:294,164690,488,942624,636,419016,945,152
3Apr 1, 2023 19:294,201693,525,074630,123,465016,936,960
4Apr 1, 2023 19:294,211663,802,690607,600,00023,984,00016,982,016
5Apr 1, 2023 19:294,215656,867,136604,311,00027,968,00017,022,976
6Apr 1, 2023 19:294,221657,451,024607,213,00025,966,00017,051,648
7Apr 1, 2023 19:294,224656,106,852610,619,00022,985,00016,957,440
8Apr 1, 2023 19:294,225656,251,968610,736,00022,990,00016,957,440
9Apr 1, 2023 19:294,227657,242,383610,140,00023,966,00016,953,344
10Apr 1, 2023 19:294,228662,146,086611,293,00022,973,00016,949,248
11Apr 1, 2023 19:294,262664,168,768615,315,00023,973,00017,190,912
12Apr 1, 2023 19:294,273671,518,458616,043,00024,961,00017,178,624