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 30, 2026 00:05anboto1anboto1Score: 2,959Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:122,957453,743,177428,647,00015,024,00016,793,600
2Jul 30, 2026 00:122,957453,676,247428,659,00014,981,00016,793,600
3Jul 30, 2026 00:122,957453,666,346428,523,00015,038,00016,793,600
4Jul 30, 2026 00:122,957453,627,176428,415,00015,157,00016,793,600
5Jul 30, 2026 00:122,959458,997,663428,812,00015,088,00016,793,600
6Jul 30, 2026 00:122,960454,121,239429,159,00014,972,00016,793,600
7Jul 30, 2026 00:122,961454,143,316429,067,00015,095,00016,793,600
8Jul 30, 2026 00:122,962454,348,731429,349,00015,024,00016,793,600
9Jul 30, 2026 00:122,968455,344,531430,117,00015,168,00016,793,600