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 listJun 24, 2026 13:59anboto1anboto1Score: 3,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 13:593,091473,221,408438,621,00025,151,00016,793,600
2Jun 24, 2026 13:593,093473,090,852438,828,00025,141,00016,793,600
3Jun 24, 2026 13:593,093473,231,924438,674,00025,343,00016,793,600
4Jun 24, 2026 13:593,103475,877,293440,981,00024,615,00016,793,600
5Jun 24, 2026 13:593,112476,032,800440,972,00025,948,00016,793,600
6Jun 24, 2026 13:593,112476,078,614440,988,00025,896,00016,793,600
7Jun 24, 2026 13:593,114476,493,845441,893,00025,355,00016,793,600
8Jun 24, 2026 13:593,116476,800,048442,133,00025,387,00016,793,600
9Jun 24, 2026 13:593,119477,264,675441,881,00026,038,00016,793,600