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:59anboto1anboto1Score: 3,180Success
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 23:023,174486,196,536462,831,00013,408,00016,797,696
2Jul 29, 2026 23:023,175486,360,010462,860,00013,458,00016,797,696
3Jul 29, 2026 23:023,176486,495,455462,939,00013,551,00016,797,696
4Jul 29, 2026 23:023,176486,623,720463,126,00013,376,00016,797,696
5Jul 29, 2026 23:023,180487,185,944463,586,00013,514,00016,797,696
6Jul 29, 2026 23:023,181487,140,012463,639,00013,548,00016,797,696
7Jul 29, 2026 23:023,181487,288,020463,739,00013,555,00016,797,696
8Jul 29, 2026 23:023,181487,564,935463,659,00013,590,00016,797,696
9Jul 29, 2026 23:023,186487,914,885464,386,00013,557,00016,797,696