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 13:47limanjun99limanjun99Score: 4,984Success
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 13:474,959766,801,379728,919,00014,977,00017,207,296
2Mar 21, 2026 13:474,969773,375,288725,455,00019,957,00017,055,744
3Mar 21, 2026 13:474,982774,557,625727,385,00019,983,00017,076,224
4Mar 21, 2026 13:474,983772,696,210728,533,00018,961,00016,994,304
5Mar 21, 2026 13:474,984773,648,057724,621,00022,956,00016,990,208
6Mar 21, 2026 13:474,999779,160,431731,816,00017,970,00017,092,608
7Mar 21, 2026 13:475,018778,022,576736,749,00015,972,00016,969,728
8Mar 21, 2026 13:475,030790,118,372735,557,00018,962,00017,092,608
9Mar 21, 2026 13:475,034783,037,342735,160,00019,977,00016,990,208