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 listJul 29, 2026 21:12anboto1anboto1Score: 3,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 21:123,416522,438,915490,717,00021,697,00016,793,600
2Jul 29, 2026 21:123,424525,333,648491,957,00021,696,00016,793,600
3Jul 29, 2026 21:123,428524,350,030492,298,00022,010,00016,793,600
4Jul 29, 2026 21:123,444527,794,944494,715,00021,898,00016,793,600
5Jul 29, 2026 21:123,466529,994,981498,099,00021,860,00016,793,600
6Jul 29, 2026 21:123,544541,583,865509,684,00021,963,00016,793,600
7Jul 29, 2026 21:123,582547,351,270515,434,00021,951,00016,793,600
8Jul 29, 2026 21:123,624553,675,041521,920,00021,705,00016,793,600
9Jul 29, 2026 21:123,738570,813,191539,111,00021,718,00016,793,600