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 20:41anboto1anboto1Score: 3,926Success
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 20:413,828585,598,803548,518,00025,739,00016,793,600
2Jul 29, 2026 20:413,841586,233,431550,797,00025,422,00016,793,600
3Jul 29, 2026 20:413,845586,753,871551,548,00025,350,00016,793,600
4Jul 29, 2026 20:413,852587,793,443552,364,00025,518,00016,793,600
5Jul 29, 2026 20:413,926598,900,986562,954,00026,006,00016,793,600
6Jul 29, 2026 20:413,981607,272,464571,774,00025,444,00016,793,600
7Jul 29, 2026 20:414,035615,273,897580,639,00024,663,00016,793,600
8Jul 29, 2026 20:414,069620,757,428585,838,00024,520,00016,793,600
9Jul 29, 2026 20:414,134630,158,438595,766,00024,422,00016,793,600