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:49limanjun99limanjun99Score: 4,976Success
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:494,946765,698,026720,862,00020,966,00017,002,496
2Mar 21, 2026 13:494,947765,964,935727,104,00014,981,00016,998,400
3Mar 21, 2026 13:494,969768,755,294726,306,00018,981,00016,998,400
4Mar 21, 2026 13:494,975772,055,427728,215,00017,980,00017,195,008
5Mar 21, 2026 13:494,976773,309,991731,471,00014,989,00016,957,440
6Mar 21, 2026 13:494,981771,870,778729,217,00017,980,00016,998,400
7Mar 21, 2026 13:494,993773,215,256731,934,00016,975,00017,186,816
8Mar 21, 2026 13:495,025776,745,385735,797,00017,970,00017,096,704
9Mar 21, 2026 13:496,011927,148,718884,651,00016,974,00017,154,048