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:04Yuriy 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 1, 2023 21:043,919656,478,336587,910,090016,941,056
2Apr 1, 2023 21:043,921654,115,962588,096,016016,936,960
3Apr 1, 2023 21:043,921653,702,467588,146,775016,932,864
4Apr 1, 2023 21:043,943620,897,131566,527,00024,979,00017,072,128
5Apr 1, 2023 21:043,943622,932,810569,539,00021,982,00017,010,688
6Apr 1, 2023 21:043,944613,157,325561,591,00029,978,00017,096,704
7Apr 1, 2023 21:043,945618,960,400567,704,00023,987,00016,961,536
8Apr 1, 2023 21:043,945614,706,219565,713,00025,986,00017,022,976
9Apr 1, 2023 21:043,945614,754,618567,783,00023,990,00017,068,032
10Apr 1, 2023 21:043,946615,115,805571,935,00019,997,00016,957,440
11Apr 1, 2023 21:043,947616,066,637567,002,00025,000,00016,957,440
12Apr 1, 2023 21:043,947612,983,929564,033,00028,001,00016,969,728