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 22:23Yuriy LyfenkoYuriy LyfenkoScore: 3,955Success
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 22:233,925644,561,140588,715,997016,924,672
2Apr 22, 2023 22:233,927657,993,963588,986,245016,932,864
3Apr 22, 2023 22:233,927651,651,852589,021,105016,932,864
4Apr 22, 2023 22:233,952619,264,896566,786,00025,990,00017,014,784
5Apr 22, 2023 22:233,952621,266,911567,826,00024,992,00017,203,200
6Apr 22, 2023 22:233,955618,334,366567,170,00026,007,00017,203,200
7Apr 22, 2023 22:233,955624,305,656567,206,00026,009,00017,203,200
8Apr 22, 2023 22:233,955619,100,896564,263,00029,013,00017,137,664
9Apr 22, 2023 22:233,956620,724,033565,341,00028,016,00017,170,432
10Apr 22, 2023 22:233,957621,398,716567,561,00025,979,00017,072,128
11Apr 22, 2023 22:233,957617,741,725565,579,00027,979,00017,031,168
12Apr 22, 2023 22:233,957621,787,705565,621,00027,981,00016,994,304