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 listMay 17, 2026 02:53M-RochatM-RochatScore: 4,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:544,270649,525,281618,796,00021,719,00016,793,600
2May 17, 2026 02:544,270649,735,054619,123,00021,456,00016,793,600
3May 17, 2026 02:544,273652,520,241619,769,00021,325,00016,793,600
4May 17, 2026 02:544,273649,932,237619,277,00021,748,00016,793,600
5May 17, 2026 02:544,274651,122,569619,811,00021,400,00016,793,600
6May 17, 2026 02:544,274649,994,253618,406,00022,704,00016,793,600
7May 17, 2026 02:544,275651,585,418619,761,00021,614,00016,793,600
8May 17, 2026 02:544,275652,099,790619,845,00021,508,00016,793,600
9May 17, 2026 02:544,275650,264,284619,623,00021,640,00016,793,600