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 19:06anboto1anboto1Score: 2,735Success
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 19:072,729419,537,222394,884,00014,603,00016,793,600
2Jul 29, 2026 19:072,730419,852,211395,025,00014,598,00016,793,600
3Jul 29, 2026 19:072,731419,800,103395,157,00014,573,00016,793,600
4Jul 29, 2026 19:072,731419,770,998395,157,00014,632,00016,793,600
5Jul 29, 2026 19:072,735420,544,778395,328,00015,070,00016,793,600
6Jul 29, 2026 19:072,736420,382,971395,810,00014,647,00016,793,600
7Jul 29, 2026 19:072,737420,643,462395,980,00014,676,00016,793,600
8Jul 29, 2026 19:072,737420,617,888396,099,00014,572,00016,793,600
9Jul 29, 2026 19:072,743421,714,929396,968,00014,607,00016,793,600