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 28, 2026 09:25TudyMTudyMScore: 5,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:265,310813,009,855774,645,00021,989,00017,104,896
2Apr 28, 2026 09:265,312819,713,121784,907,00011,998,00017,235,968
3Apr 28, 2026 09:265,316815,953,469781,439,00015,988,00017,231,872
4Apr 28, 2026 09:265,318818,808,225780,796,00016,995,00017,141,760
5Apr 28, 2026 09:265,325816,334,320782,848,00015,996,00017,219,584
6Apr 28, 2026 09:265,327821,913,120783,153,00016,003,00016,973,824
7Apr 28, 2026 09:265,328818,976,230778,344,00020,982,00017,227,776
8Apr 28, 2026 09:265,341825,160,525788,200,00013,003,00017,227,776
9Apr 28, 2026 09:265,350818,579,364784,585,00017,990,00017,035,264