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:44limanjun99limanjun99Score: 5,674Success
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:445,624869,710,917828,613,00014,974,00017,039,360
2Mar 21, 2026 13:445,627871,185,880828,091,00015,963,00017,002,496
3Mar 21, 2026 13:445,632872,781,660824,775,00019,970,00017,154,048
4Mar 21, 2026 13:445,647878,169,839822,157,00024,944,00017,084,416
5Mar 21, 2026 13:445,674879,623,024823,191,00027,938,00016,977,920
6Mar 21, 2026 13:445,720886,186,536838,104,00019,954,00017,002,496
7Mar 21, 2026 13:445,770886,608,177840,578,00024,957,00016,998,400
8Mar 21, 2026 13:445,843900,812,584852,435,00023,956,00017,043,456
9Mar 21, 2026 13:446,9631,074,428,6731,017,563,00026,935,00017,059,840