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 21:21Yuriy 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 1, 2023 21:213,921654,448,820588,077,156016,945,152
2Apr 1, 2023 21:213,922668,620,877588,273,854016,945,152
3Apr 1, 2023 21:213,922667,790,282588,315,502016,945,152
4Apr 1, 2023 21:213,940612,541,537570,032,00021,001,00017,031,168
5Apr 1, 2023 21:213,941617,077,594571,095,00020,003,00017,133,568
6Apr 1, 2023 21:213,944616,015,097565,576,00025,980,00016,969,728
7Apr 1, 2023 21:213,944614,205,869566,593,00024,982,00016,961,536
8Apr 1, 2023 21:213,945620,490,425565,703,00025,986,00016,973,824
9Apr 1, 2023 21:213,945625,635,800568,773,00022,990,00017,031,168
10Apr 1, 2023 21:213,946612,741,624567,866,00023,994,00017,195,008
11Apr 1, 2023 21:213,946618,956,272565,883,00025,994,00016,957,440
12Apr 1, 2023 21:213,947616,701,851566,015,00026,000,00017,207,296