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:35anboto1anboto1Score: 2,999Success
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:362,997459,826,219434,695,00014,950,00016,793,600
2Jul 29, 2026 21:362,997459,728,356434,694,00014,997,00016,793,600
3Jul 29, 2026 21:362,998459,854,175434,750,00015,036,00016,793,600
4Jul 29, 2026 21:362,999459,788,228434,934,00014,943,00016,793,600
5Jul 29, 2026 21:362,999460,079,607434,890,00015,062,00016,793,600
6Jul 29, 2026 21:363,000460,155,550435,086,00015,003,00016,793,600
7Jul 29, 2026 21:363,002460,413,989435,394,00014,988,00016,793,600
8Jul 29, 2026 21:363,002460,553,508435,436,00015,007,00016,793,600
9Jul 29, 2026 21:363,046476,766,003441,885,00015,121,00016,793,600