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:28anboto1anboto1Score: 3,497Success
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:283,475531,485,343492,003,00029,301,00016,793,600
2Jul 29, 2026 21:283,486532,965,100493,334,00029,647,00016,793,600
3Jul 29, 2026 21:283,493534,188,991494,728,00029,342,00016,793,600
4Jul 29, 2026 21:283,494534,130,827494,098,00030,057,00016,793,600
5Jul 29, 2026 21:283,497534,698,841495,647,00029,024,00016,793,600
6Jul 29, 2026 21:283,500534,880,931495,660,00029,377,00016,793,600
7Jul 29, 2026 21:283,501536,771,596495,344,00029,846,00016,793,600
8Jul 29, 2026 21:283,502535,500,249496,208,00029,230,00016,793,600
9Jul 29, 2026 21:283,511536,845,062496,793,00029,956,00016,793,600