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 17:08anboto1anboto1Score: 2,950Success
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 17:092,943451,603,618428,956,00012,523,00016,793,600
2Jul 29, 2026 17:092,944451,627,845429,240,00012,420,00016,793,600
3Jul 29, 2026 17:092,947452,126,974429,574,00012,532,00016,793,600
4Jul 29, 2026 17:092,947452,120,844429,655,00012,483,00016,793,600
5Jul 29, 2026 17:092,950452,624,891430,016,00012,500,00016,793,600
6Jul 29, 2026 17:092,953453,254,643430,489,00012,595,00016,793,600
7Jul 29, 2026 17:092,955453,728,174430,783,00012,534,00016,793,600
8Jul 29, 2026 17:092,957453,712,809431,033,00012,663,00016,793,600
9Jul 29, 2026 17:092,957453,716,373431,146,00012,487,00016,793,600