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:29anboto1anboto1Score: 3,118Success
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:303,111476,027,425441,976,00024,792,00016,793,600
2Jun 24, 2026 13:303,112476,662,476440,957,00025,844,00016,793,600
3Jun 24, 2026 13:303,114476,291,562441,328,00025,775,00016,793,600
4Jun 24, 2026 13:303,115476,506,658441,508,00025,809,00016,793,600
5Jun 24, 2026 13:303,118477,002,092441,848,00025,989,00016,793,600
6Jun 24, 2026 13:303,123477,700,186443,288,00025,309,00016,793,600
7Jun 24, 2026 13:303,126478,068,640442,899,00026,056,00016,793,600
8Jun 24, 2026 13:303,127478,783,792443,587,00025,514,00016,793,600
9Jun 24, 2026 13:303,129478,541,756443,893,00025,587,00016,793,600