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 listApr 1, 2025 21:30Aniruddha DebAniruddha DebScore: 4,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2025 21:304,559708,539,177681,855,0001,999,00017,121,280
2Apr 1, 2025 21:304,565704,763,570682,808,0001,999,00017,203,200
3Apr 1, 2025 21:304,566705,858,264682,915,0001,999,00017,203,200
4Apr 1, 2025 21:304,569713,495,383683,306,0002,000,00017,207,296
5Apr 1, 2025 21:304,570717,777,766682,544,0002,997,00017,203,200
6Apr 1, 2025 21:304,571704,064,008682,578,0002,998,00017,113,088
7Apr 1, 2025 21:304,571712,652,995683,659,0001,999,00017,108,992
8Apr 1, 2025 21:304,573713,002,328684,023,0002,000,00017,203,200
9Apr 1, 2025 21:304,574718,783,564684,088,0002,000,00017,207,296