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 21:27anboto1anboto1Score: 3,101Success
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 21:273,095474,377,158449,488,00014,867,00016,793,600
2Jul 29, 2026 21:273,096474,943,288449,644,00014,870,00016,793,600
3Jul 29, 2026 21:273,096474,362,879449,550,00014,930,00016,793,600
4Jul 29, 2026 21:273,100475,018,791450,071,00014,948,00016,793,600
5Jul 29, 2026 21:273,101475,403,335450,277,00014,938,00016,793,600
6Jul 29, 2026 21:273,102475,323,042450,172,00015,181,00016,793,600
7Jul 29, 2026 21:273,102475,864,431450,355,00014,957,00016,793,600
8Jul 29, 2026 21:273,104476,857,144450,642,00015,072,00016,793,600
9Jul 29, 2026 21:273,109476,339,388451,614,00014,801,00016,793,600