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 19:28Yuriy 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 22, 2023 19:283,913658,922,860586,910,354016,920,576
2Apr 22, 2023 19:283,914647,748,531587,061,125016,928,768
3Apr 22, 2023 19:283,914658,530,280587,134,342016,932,864
4Apr 22, 2023 19:283,943615,147,995566,489,00024,977,00017,203,200
5Apr 22, 2023 19:283,944618,041,058566,564,00024,980,00017,072,128
6Apr 22, 2023 19:283,944615,515,231565,592,00025,981,00017,186,816
7Apr 22, 2023 19:283,944619,797,540567,615,00023,983,00016,945,152
8Apr 22, 2023 19:283,944615,735,061566,680,00024,985,00017,174,528
9Apr 22, 2023 19:283,945614,992,995564,739,00026,987,00016,945,152
10Apr 22, 2023 19:283,946615,885,357565,872,00025,994,00016,945,152
11Apr 22, 2023 19:283,946622,878,464565,898,00025,995,00017,182,720
12Apr 22, 2023 19:283,946619,426,306564,976,00026,998,00017,145,856