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 listJul 29, 2026 22:30anboto1anboto1Score: 2,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 22:312,888443,177,946419,947,00013,256,00016,793,600
2Jul 29, 2026 22:312,888443,209,780419,981,00013,291,00016,793,600
3Jul 29, 2026 22:312,889443,377,292420,147,00013,246,00016,793,600
4Jul 29, 2026 22:312,890443,646,184420,372,00013,231,00016,793,600
5Jul 29, 2026 22:312,890443,489,324420,279,00013,226,00016,793,600
6Jul 29, 2026 22:312,890443,674,547420,380,00013,205,00016,793,600
7Jul 29, 2026 22:312,893444,168,988420,757,00013,339,00016,793,600
8Jul 29, 2026 22:312,894444,060,777420,925,00013,235,00016,793,600
9Jul 29, 2026 22:312,894444,003,889420,790,00013,332,00016,793,600