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 listJun 24, 2026 14:06anboto1anboto1Score: 3,104Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 14:073,092472,999,298438,549,00025,261,00016,793,600
2Jun 24, 2026 14:073,093473,217,270438,915,00025,047,00016,793,600
3Jun 24, 2026 14:073,094473,445,536438,545,00025,683,00016,793,600
4Jun 24, 2026 14:073,100474,311,600439,768,00025,274,00016,793,600
5Jun 24, 2026 14:073,104474,897,601440,325,00025,400,00016,793,600
6Jun 24, 2026 14:073,106475,193,413440,841,00025,108,00016,793,600
7Jun 24, 2026 14:073,106475,104,681440,348,00025,641,00016,793,600
8Jun 24, 2026 14:073,108476,348,160439,821,00026,387,00016,793,600
9Jun 24, 2026 14:073,109475,500,998440,452,00025,962,00016,793,600