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 listJun 21, 2025 20:49Aniruddha DebAniruddha DebScore: 4,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 20:494,346674,757,558649,968,0001,999,00016,965,632
2Jun 21, 2025 20:494,348681,117,227651,135,0001,000,00017,055,744
3Jun 21, 2025 20:494,352675,769,700651,834,000999,00016,945,152
4Jun 21, 2025 20:494,352677,254,197651,867,000999,00016,945,152
5Jun 21, 2025 20:494,353678,781,142650,948,0001,999,00016,965,632
6Jun 21, 2025 20:494,356676,775,194651,363,0001,998,00017,199,104
7Jun 21, 2025 20:494,357677,550,538650,499,0002,997,00016,949,248
8Jun 21, 2025 20:494,375680,892,753653,207,0002,996,00016,945,152
9Jun 21, 2025 20:494,379686,851,170653,840,0002,999,00016,953,344