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, 2026 10:47limanjun99limanjun99Score: 53,972Success
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, 2026 10:4752,7907,960,456,1157,880,598,00037,925,00017,088,512
2Mar 21, 2026 10:4753,3748,046,769,9857,965,198,00040,918,00017,084,416
3Mar 21, 2026 10:4753,8728,125,440,9838,031,838,00048,895,00016,936,960
4Mar 21, 2026 10:4753,8888,121,663,7108,039,245,00043,913,00016,961,536
5Mar 21, 2026 10:4753,9728,140,569,0788,055,899,00039,920,00017,186,816
6Mar 21, 2026 10:4754,0588,150,006,0408,070,720,00037,923,00017,186,816
7Mar 21, 2026 10:4754,0648,146,184,3928,076,639,00032,953,00016,941,056
8Mar 21, 2026 10:4754,2758,174,496,9828,106,265,00034,953,00016,969,728
9Mar 21, 2026 10:4754,5918,232,332,7568,147,662,00040,927,00016,945,152