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:22Aniruddha DebAniruddha DebScore: 4,207Success
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:224,198654,534,212628,769,000999,00017,108,992
2Aug 14, 2025 22:224,199651,829,178628,830,000999,00017,211,392
3Aug 14, 2025 22:224,204653,352,314628,569,0001,998,00017,108,992
4Aug 14, 2025 22:224,205656,321,823629,810,000999,00017,108,992
5Aug 14, 2025 22:224,207655,546,053630,106,0001,000,00017,211,392
6Aug 14, 2025 22:224,208656,594,946630,212,0001,000,00017,211,392
7Aug 14, 2025 22:224,210661,308,689630,545,000999,00017,113,088
8Aug 14, 2025 22:224,218653,782,818630,694,0001,999,00017,219,584
9Aug 14, 2025 22:224,223656,979,116630,392,0002,997,00017,190,912