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 16:05anboto1anboto1Score: 2,975Success
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 16:052,961454,267,643432,654,00011,597,00016,793,600
2Jul 29, 2026 16:052,964454,664,584433,037,00011,569,00016,793,600
3Jul 29, 2026 16:052,966456,244,123433,414,00011,623,00016,793,600
4Jul 29, 2026 16:052,971455,723,835434,101,00011,577,00016,793,600
5Jul 29, 2026 16:052,975456,319,682434,652,00011,691,00016,793,600
6Jul 29, 2026 16:052,987458,172,942435,967,00012,151,00016,793,600
7Jul 29, 2026 16:052,991458,851,520436,753,00012,009,00016,793,600
8Jul 29, 2026 16:052,994459,505,390436,984,00012,197,00016,793,600
9Jul 29, 2026 16:052,998459,906,558437,572,00012,194,00016,793,600