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 listMar 21, 2023 04:11Yuriy LyfenkoYuriy LyfenkoScore: 4,530Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2023 04:114,340706,803,332650,945,878016,945,152
2Mar 21, 2023 04:114,364709,622,895654,617,057016,953,344
3Mar 21, 2023 04:114,382685,108,978633,342,00023,975,00017,018,880
4Mar 21, 2023 04:114,388719,930,065658,204,680016,953,344
5Mar 21, 2023 04:114,476698,875,218643,421,00027,974,00017,027,072
6Mar 21, 2023 04:114,496695,137,714645,390,00028,972,00017,022,976
7Mar 21, 2023 04:114,530706,108,044652,452,00026,977,00017,166,336
8Mar 21, 2023 04:114,575714,102,349656,252,00029,965,00017,133,568
9Mar 21, 2023 04:114,576712,809,046662,363,00023,976,00017,199,104
10Mar 21, 2023 04:114,593717,956,837663,960,00024,960,00016,965,632
11Mar 21, 2023 04:114,614713,499,229669,100,00022,969,00016,965,632
12Mar 21, 2023 04:114,658727,351,526673,782,00024,954,00016,969,728