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:33anboto1anboto1Score: 4,611Success
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:334,540691,026,379660,459,00020,558,00016,793,600
2Jul 29, 2026 20:334,540691,169,800660,374,00020,757,00016,793,600
3Jul 29, 2026 20:334,542692,715,971660,853,00020,557,00016,793,600
4Jul 29, 2026 20:334,543691,354,294660,860,00020,600,00016,793,600
5Jul 29, 2026 20:334,611701,739,350670,695,00020,959,00016,793,600
6Jul 29, 2026 20:334,625703,913,467672,802,00020,972,00016,793,600
7Jul 29, 2026 20:334,641706,512,066674,802,00021,377,00016,793,600
8Jul 29, 2026 20:334,669710,439,675679,046,00021,394,00016,793,600
9Jul 29, 2026 20:334,716717,444,398686,903,00020,524,00016,793,600