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 22:12anboto1anboto1Score: 3,061Success
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 22:133,055469,107,257442,830,00015,485,00016,793,600
2Jul 29, 2026 22:133,056468,680,016443,401,00015,107,00016,793,600
3Jul 29, 2026 22:133,057468,488,171443,303,00015,277,00016,793,600
4Jul 29, 2026 22:133,061469,214,757443,994,00015,276,00016,793,600
5Jul 29, 2026 22:133,061469,065,972443,710,00015,555,00016,793,600
6Jul 29, 2026 22:133,061469,660,097444,014,00015,261,00016,793,600
7Jul 29, 2026 22:133,064469,619,092444,641,00015,010,00016,793,600
8Jul 29, 2026 22:133,065469,881,763444,520,00015,354,00016,793,600
9Jul 29, 2026 22:133,067470,904,980444,652,00015,543,00016,793,600