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 15:45anboto1anboto1Score: 3,015Success
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 15:453,004459,894,504438,808,00011,928,00016,793,600
2Jun 24, 2026 15:453,007460,283,426439,073,00012,023,00016,793,600
3Jun 24, 2026 15:453,007460,183,098438,983,00012,103,00016,793,600
4Jun 24, 2026 15:453,014461,676,566440,189,00011,938,00016,793,600
5Jun 24, 2026 15:453,015461,400,175440,225,00012,031,00016,793,600
6Jun 24, 2026 15:453,018461,820,852441,104,00011,616,00016,793,600
7Jun 24, 2026 15:453,073470,913,438449,645,00011,439,00016,793,600
8Jun 24, 2026 15:453,404519,740,532499,328,00011,277,00016,793,600
9Jun 24, 2026 15:453,981606,478,572585,424,00011,782,00016,793,600