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 17, 2026 14:14Victor MerckléVictor MerckléScore: 1,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 14:151,745271,098,048254,078,0007,796,00016,797,696
2Jun 17, 2026 14:151,745271,000,693254,176,0007,676,00016,797,696
3Jun 17, 2026 14:151,746271,237,755254,328,0007,680,00016,797,696
4Jun 17, 2026 14:151,746271,640,067254,197,0007,844,00016,797,696
5Jun 17, 2026 14:151,747271,313,410254,432,0007,721,00016,797,696
6Jun 17, 2026 14:151,748271,449,539254,513,0007,727,00016,797,696
7Jun 17, 2026 14:151,752271,953,243255,086,0007,749,00016,797,696
8Jun 17, 2026 14:151,752272,036,460255,128,0007,801,00016,797,696
9Jun 17, 2026 14:151,753272,885,939255,271,0007,778,00016,797,696