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 22, 2023 15:11Yuriy LyfenkoYuriy LyfenkoScore: 3,943Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2023 15:113,916651,109,991587,454,358016,949,248
2Apr 22, 2023 15:113,918649,670,999587,651,385016,932,864
3Apr 22, 2023 15:113,918643,830,292587,745,589016,932,864
4Apr 22, 2023 15:113,941617,023,222568,194,00023,007,00016,953,344
5Apr 22, 2023 15:113,942617,606,814566,339,00025,014,00016,973,824
6Apr 22, 2023 15:113,943616,212,580565,526,00025,978,00016,957,440
7Apr 22, 2023 15:113,943615,553,206566,541,00024,979,00017,190,912
8Apr 22, 2023 15:113,944615,966,951568,609,00022,984,00017,039,360
9Apr 22, 2023 15:113,944615,661,879563,647,00027,982,00017,162,240
10Apr 22, 2023 15:113,944618,325,159567,653,00023,985,00017,039,360
11Apr 22, 2023 15:113,945614,978,224564,702,00026,985,00016,957,440
12Apr 22, 2023 15:113,945612,740,571563,747,00027,987,00016,969,728