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 13, 2026 11:46Dominique GarmierDominique GarmierScore: 17,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 11:4617,4202,647,637,7662,579,125,00033,935,00017,035,264
2Mar 13, 2026 11:4617,5112,657,812,9522,598,724,00027,954,00016,961,536
3Mar 13, 2026 11:4617,5442,663,400,2292,598,600,00032,944,00017,170,432
4Mar 13, 2026 11:4617,6072,670,158,3492,612,101,00028,945,00017,031,168
5Mar 13, 2026 11:4617,6232,676,805,0852,611,520,00031,945,00016,961,536
6Mar 13, 2026 11:4617,6322,679,502,6202,612,817,00031,936,00016,973,824
7Mar 13, 2026 11:4617,6932,691,153,2902,625,029,00028,945,00017,080,320
8Mar 13, 2026 11:4617,7792,700,599,2412,632,988,00033,935,00016,961,536
9Mar 13, 2026 11:4618,0042,735,609,5962,666,604,00033,931,00017,051,648