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:27Yuriy LyfenkoYuriy LyfenkoScore: 3,945Success
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:273,914659,089,197587,043,489016,928,768
2Apr 22, 2023 19:273,914660,426,653587,075,745016,924,672
3Apr 22, 2023 19:273,914645,788,260587,083,411016,941,056
4Apr 22, 2023 19:273,942619,686,159566,243,00025,010,00017,084,416
5Apr 22, 2023 19:273,942617,816,995566,273,00025,012,00017,018,880
6Apr 22, 2023 19:273,944620,625,020569,602,00021,984,00017,203,200
7Apr 22, 2023 19:273,945612,895,473567,702,00023,987,00017,203,200
8Apr 22, 2023 19:273,945614,762,181561,715,00029,984,00017,174,528
9Apr 22, 2023 19:273,945613,310,459564,809,00026,990,00017,203,200
10Apr 22, 2023 19:273,946618,426,787565,847,00025,992,00017,203,200
11Apr 22, 2023 19:273,948619,409,167566,156,00026,007,00016,957,440
12Apr 22, 2023 19:273,951615,823,364568,702,00023,987,00017,059,840