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 18:33anboto1anboto1Score: 2,780Success
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 18:342,773426,316,306400,377,00015,602,00016,793,600
2Jul 29, 2026 18:342,777427,664,184400,825,00015,863,00016,793,600
3Jul 29, 2026 18:342,777427,699,421400,665,00015,897,00016,797,696
4Jul 29, 2026 18:342,779427,859,474400,996,00015,860,00016,797,696
5Jul 29, 2026 18:342,780428,192,022401,438,00015,608,00016,797,696
6Jul 29, 2026 18:342,784428,174,550401,963,00015,763,00016,797,696
7Jul 29, 2026 18:342,784428,730,417401,737,00015,982,00016,797,696
8Jul 29, 2026 18:342,786428,769,792402,181,00015,779,00016,797,696
9Jul 29, 2026 18:342,787428,425,448402,275,00015,795,00016,797,696