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:56anboto1anboto1Score: 2,872Success
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:562,870440,793,003417,578,00013,059,00016,793,600
2Jul 29, 2026 22:562,871440,690,252417,696,00013,054,00016,793,600
3Jul 29, 2026 22:562,871440,648,454417,672,00013,048,00016,793,600
4Jul 29, 2026 22:562,872440,780,576417,746,00013,089,00016,793,600
5Jul 29, 2026 22:562,872440,744,685417,717,00013,112,00016,793,600
6Jul 29, 2026 22:562,872440,884,900417,668,00013,161,00016,793,600
7Jul 29, 2026 22:562,875441,318,990418,166,00013,212,00016,793,600
8Jul 29, 2026 22:562,876441,372,140418,375,00013,167,00016,793,600
9Jul 29, 2026 22:562,876441,389,839418,180,00013,227,00016,793,600