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 21:15Yuriy LyfenkoYuriy LyfenkoScore: 3,944Success
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 21:153,919648,280,565587,894,961016,945,152
2Apr 1, 2023 21:153,920667,561,093588,030,742016,941,056
3Apr 1, 2023 21:153,921648,535,451588,097,194016,932,864
4Apr 1, 2023 21:153,942619,973,148568,286,00023,011,00017,149,952
5Apr 1, 2023 21:153,942620,156,650568,315,00023,012,00017,195,008
6Apr 1, 2023 21:153,944620,178,020564,557,00026,978,00016,961,536
7Apr 1, 2023 21:153,944613,793,445562,568,00028,977,00017,190,912
8Apr 1, 2023 21:153,944617,402,318567,625,00023,984,00017,190,912
9Apr 1, 2023 21:153,944615,958,020567,638,00023,984,00017,076,224
10Apr 1, 2023 21:153,945624,545,710566,810,00024,991,00017,076,224
11Apr 1, 2023 21:153,946617,638,799570,870,00020,995,00016,969,728
12Apr 1, 2023 21:153,948617,108,463567,150,00025,006,00017,195,008