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 20, 2026 17:08M-RochatM-RochatScore: 4,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:094,312656,254,629625,602,00021,208,00016,793,600
2May 20, 2026 17:094,318657,914,290626,632,00021,147,00016,793,600
3May 20, 2026 17:094,319657,591,173626,703,00021,211,00016,793,600
4May 20, 2026 17:094,324660,970,185627,265,00021,455,00016,793,600
5May 20, 2026 17:094,325660,382,249627,605,00021,253,00016,793,600
6May 20, 2026 17:094,339661,743,474629,610,00021,320,00016,793,600
7May 20, 2026 17:094,363666,652,631633,273,00021,183,00016,793,600
8May 20, 2026 17:094,364664,127,881633,502,00021,181,00016,793,600
9May 20, 2026 17:094,369666,652,968634,677,00020,729,00016,793,600