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 14, 2025 22:23Aniruddha DebAniruddha DebScore: 4,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2025 22:234,197657,209,320627,533,0001,998,00017,211,392
2Aug 14, 2025 22:234,200658,285,329629,030,0001,000,00016,949,248
3Aug 14, 2025 22:234,202654,373,860628,311,0002,000,00017,108,992
4Aug 14, 2025 22:234,202655,007,908629,364,0001,000,00017,117,184
5Aug 14, 2025 22:234,205653,356,106626,682,0003,997,00017,219,584
6Aug 14, 2025 22:234,207653,633,749631,002,000016,949,248
7Aug 14, 2025 22:234,207654,623,050629,124,0002,000,00017,211,392
8Aug 14, 2025 22:234,212655,803,084630,823,000999,00017,113,088
9Aug 14, 2025 22:234,213657,359,291631,966,000017,211,392