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 25, 2026 13:22Navneet RajNavneet RajScore: 3,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 13:233,089473,346,358455,830,0007,624,00016,793,600
2Aug 25, 2026 13:233,089473,341,877456,071,0007,350,00016,793,600
3Aug 25, 2026 13:233,090474,165,455455,990,0007,570,00016,793,600
4Aug 25, 2026 13:233,091473,556,219456,196,0007,534,00016,793,600
5Aug 25, 2026 13:233,092473,670,165456,353,0007,522,00016,793,600
6Aug 25, 2026 13:233,092473,702,440456,588,0007,313,00016,793,600
7Aug 25, 2026 13:233,095474,195,822456,929,0007,386,00016,793,600
8Aug 25, 2026 13:233,096474,289,744456,958,0007,585,00016,793,600
9Aug 25, 2026 13:233,096474,385,720456,900,0007,641,00016,793,600