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:45anboto1anboto1Score: 3,675Success
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:453,647557,065,847521,808,00025,298,00016,793,600
2Jul 29, 2026 20:453,648557,149,245522,726,00024,518,00016,793,600
3Jul 29, 2026 20:453,653558,033,250522,544,00025,410,00016,793,600
4Jul 29, 2026 20:453,673560,844,452526,128,00024,842,00016,793,600
5Jul 29, 2026 20:453,675561,190,121526,876,00024,390,00016,793,600
6Jul 29, 2026 20:453,676562,097,196525,653,00025,782,00016,793,600
7Jul 29, 2026 20:453,693564,075,406529,048,00025,019,00016,793,600
8Jul 29, 2026 20:453,707566,215,349531,112,00025,085,00016,793,600
9Jul 29, 2026 20:453,713567,044,214532,469,00024,588,00016,793,600