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:54Yuriy LyfenkoYuriy LyfenkoScore: 4,214Success
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:544,146684,131,425621,895,831016,949,248
2Apr 1, 2023 19:544,147683,923,725622,123,021016,932,864
3Apr 1, 2023 19:544,148691,373,518622,261,887016,936,960
4Apr 1, 2023 19:544,190655,941,209603,582,00024,982,00017,051,648
5Apr 1, 2023 19:544,198652,472,003603,655,00025,985,00016,961,536
6Apr 1, 2023 19:544,210661,774,052602,533,00028,977,00016,957,440
7Apr 1, 2023 19:544,214661,661,100605,065,00027,002,00016,994,304
8Apr 1, 2023 19:544,221656,421,082606,169,00026,963,00016,961,536
9Apr 1, 2023 19:544,227661,681,411611,128,00022,967,00016,990,208
10Apr 1, 2023 19:544,235663,614,272609,262,00025,968,00016,957,440
11Apr 1, 2023 19:544,237658,716,553609,575,00025,981,00016,953,344
12Apr 1, 2023 19:544,255662,369,817614,219,00023,969,00016,957,440