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,801Success
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,791739,109,643718,623,000017,108,992
2Apr 1, 2025 21:304,793747,561,916717,954,000999,00017,203,200
3Apr 1, 2025 21:304,794751,190,270717,155,0002,000,00017,215,488
4Apr 1, 2025 21:304,797743,987,123718,587,000999,00017,117,184
5Apr 1, 2025 21:304,801741,221,300718,089,0001,997,00017,203,200
6Apr 1, 2025 21:304,803747,622,156717,468,0002,997,00017,108,992
7Apr 1, 2025 21:304,804744,577,801717,604,0002,998,00017,199,104
8Apr 1, 2025 21:304,805745,690,242718,741,0001,999,00017,117,184
9Apr 1, 2025 21:304,810741,443,349720,570,000999,00016,961,536