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 24, 2026 14:57Navneet RajNavneet RajScore: 3,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 14:573,938600,654,301581,855,0008,888,00016,793,600
2Aug 24, 2026 14:573,938600,723,149581,811,0008,972,00016,793,600
3Aug 24, 2026 14:573,939600,802,590581,938,0008,958,00016,793,600
4Aug 24, 2026 14:573,939601,941,038582,055,0008,939,00016,793,600
5Aug 24, 2026 14:573,946601,937,070583,007,0008,935,00016,793,600
6Aug 24, 2026 14:573,951602,459,470583,696,0008,960,00016,793,600
7Aug 24, 2026 14:573,954603,088,243584,154,0009,014,00016,793,600
8Aug 24, 2026 14:573,956603,390,880584,429,0009,016,00016,793,600
9Aug 24, 2026 14:573,958603,644,372584,761,0009,011,00016,793,600