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:55anboto1anboto1Score: 3,508Success
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:553,494534,159,432499,383,00024,763,00016,793,600
2Jul 29, 2026 20:553,501535,205,353500,069,00025,131,00016,793,600
3Jul 29, 2026 20:553,504535,716,523500,692,00025,033,00016,793,600
4Jul 29, 2026 20:553,505535,687,727501,114,00024,678,00016,793,600
5Jul 29, 2026 20:553,508536,320,501501,298,00025,042,00016,793,600
6Jul 29, 2026 20:553,513537,094,308501,746,00025,226,00016,793,600
7Jul 29, 2026 20:553,516537,640,658502,124,00025,422,00016,793,600
8Jul 29, 2026 20:553,519537,944,175502,414,00025,474,00016,793,600
9Jul 29, 2026 20:553,520538,024,347502,652,00025,452,00016,793,600