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:35anboto1anboto1Score: 3,509Success
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:363,499534,948,163503,795,00021,093,00016,793,600
2Jul 29, 2026 21:363,502535,302,676503,974,00021,365,00016,793,600
3Jul 29, 2026 21:363,508536,266,402504,969,00021,367,00016,793,600
4Jul 29, 2026 21:363,508536,125,494504,923,00021,281,00016,793,600
5Jul 29, 2026 21:363,509536,299,756504,154,00022,279,00016,793,600
6Jul 29, 2026 21:363,510536,658,178504,581,00022,064,00016,793,600
7Jul 29, 2026 21:363,512536,922,243505,535,00021,387,00016,793,600
8Jul 29, 2026 21:363,512536,920,851504,570,00022,339,00016,793,600
9Jul 29, 2026 21:363,514537,173,312505,549,00021,603,00016,793,600