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 listAug 24, 2026 14:58Navneet RajNavneet RajScore: 3,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 14:593,957603,554,167584,360,0009,262,00016,793,600
2Aug 24, 2026 14:593,958603,715,804584,868,0008,957,00016,793,600
3Aug 24, 2026 14:593,958603,534,067584,784,0008,933,00016,793,600
4Aug 24, 2026 14:593,959604,767,019584,938,0008,914,00016,793,600
5Aug 24, 2026 14:593,959603,639,395584,899,0008,957,00016,793,600
6Aug 24, 2026 14:593,960604,011,208585,040,0009,057,00016,793,600
7Aug 24, 2026 14:593,961604,105,097585,252,0008,941,00016,793,600
8Aug 24, 2026 14:593,962604,230,657585,351,0009,004,00016,793,600
9Aug 24, 2026 14:593,964604,463,137585,690,0008,972,00016,793,600