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 16, 2025 15:51Aniruddha DebAniruddha DebScore: 3,933Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 15:513,917612,925,458585,602,0001,998,00016,949,248
2Aug 16, 2025 15:513,928608,984,967589,128,000016,990,208
3Aug 16, 2025 15:513,928610,638,439588,203,0001,000,00017,162,240
4Aug 16, 2025 15:513,929617,244,110589,308,000017,211,392
5Aug 16, 2025 15:513,933613,084,997589,911,000016,949,248
6Aug 16, 2025 15:513,951622,775,137590,647,0001,998,00016,949,248
7Aug 16, 2025 15:513,955621,569,846592,234,0001,000,00017,158,144
8Aug 16, 2025 15:514,020626,161,437601,992,000999,00016,957,440
9Aug 16, 2025 15:514,157650,150,913621,563,0001,998,00017,211,392