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:14anboto1anboto1Score: 2,840Success
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:152,803430,612,900408,310,00012,217,00016,793,600
2Jul 29, 2026 19:152,817432,569,340410,232,00012,335,00016,793,600
3Jul 29, 2026 19:152,826434,745,342411,477,00012,490,00016,793,600
4Jul 29, 2026 19:152,834435,169,071412,181,00012,963,00016,793,600
5Jul 29, 2026 19:152,840436,142,421413,888,00012,214,00016,793,600
6Jul 29, 2026 19:152,841436,236,967413,857,00012,374,00016,793,600
7Jul 29, 2026 19:152,861439,350,893415,761,00013,466,00016,793,600
8Jul 29, 2026 19:152,864439,817,084417,278,00012,465,00016,793,600
9Jul 29, 2026 19:152,886442,948,588419,614,00013,369,00016,793,600