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 24, 2026 16:31anboto1anboto1Score: 2,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 16:322,929448,699,248432,191,0007,276,00016,793,600
2Jun 24, 2026 16:322,930448,810,156432,110,0007,396,00016,793,600
3Jun 24, 2026 16:322,930448,759,877432,259,0007,251,00016,793,600
4Jun 24, 2026 16:322,931448,847,664432,433,0007,235,00016,793,600
5Jun 24, 2026 16:322,934449,416,133433,029,0007,173,00016,793,600
6Jun 24, 2026 16:322,936449,636,035433,214,0007,208,00016,793,600
7Jun 24, 2026 16:322,936449,670,311433,373,0007,094,00016,793,600
8Jun 24, 2026 16:322,940450,307,933434,144,0006,860,00016,793,600
9Jun 24, 2026 16:322,942450,574,806434,521,0006,842,00016,793,600