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:01Yuriy 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:013,922651,467,321588,325,463016,945,152
2Apr 1, 2023 21:013,923655,487,426588,411,997016,936,960
3Apr 1, 2023 21:013,927655,050,948588,991,954016,941,056
4Apr 1, 2023 21:013,943615,098,002568,493,00022,979,00016,961,536
5Apr 1, 2023 21:013,944616,415,780566,548,00024,980,00016,953,344
6Apr 1, 2023 21:013,944617,163,894564,646,00026,983,00017,022,976
7Apr 1, 2023 21:013,945620,626,146567,743,00023,989,00016,973,824
8Apr 1, 2023 21:013,945617,786,999566,778,00024,990,00016,957,440
9Apr 1, 2023 21:013,945620,942,458563,824,00027,991,00016,961,536
10Apr 1, 2023 21:013,947618,930,501568,093,00024,003,00016,957,440
11Apr 1, 2023 21:013,947618,581,485565,109,00027,005,00016,969,728
12Apr 1, 2023 21:013,948619,730,850566,217,00026,009,00016,982,016