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 20:05Yuriy LyfenkoYuriy LyfenkoScore: 4,171Success
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 20:054,117686,771,575617,512,828016,941,056
2Apr 1, 2023 20:054,118699,288,607617,738,248016,945,152
3Apr 1, 2023 20:054,120675,698,924617,965,730016,932,864
4Apr 1, 2023 20:054,137643,729,901594,567,00025,981,00016,969,728
5Apr 1, 2023 20:054,143644,782,655592,536,00028,977,00016,949,248
6Apr 1, 2023 20:054,171653,617,899601,686,00023,987,00016,961,536
7Apr 1, 2023 20:054,171650,015,721599,714,00025,987,00016,961,536
8Apr 1, 2023 20:054,174652,198,546598,108,00027,958,00017,084,416
9Apr 1, 2023 20:054,175648,986,625601,333,00024,972,00017,031,168
10Apr 1, 2023 20:054,176651,652,801600,360,00025,972,00017,100,800
11Apr 1, 2023 20:054,180655,031,844603,070,00023,963,00016,961,536
12Apr 1, 2023 20:054,181656,662,601599,234,00027,964,00017,063,936