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 11:22anboto1anboto1Score: 4,321Success
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 11:234,314656,420,547623,607,00023,536,00016,793,600
2Jun 24, 2026 11:234,319657,229,045623,605,00024,315,00016,793,600
3Jun 24, 2026 11:234,320657,238,119623,631,00024,369,00016,793,600
4Jun 24, 2026 11:234,321657,441,402624,400,00023,786,00016,793,600
5Jun 24, 2026 11:234,321657,545,972623,910,00024,383,00016,793,600
6Jun 24, 2026 11:234,322657,640,790623,819,00024,574,00016,793,600
7Jun 24, 2026 11:234,323657,663,331624,155,00024,324,00016,793,600
8Jun 24, 2026 11:234,323657,653,366624,637,00023,819,00016,793,600
9Jun 24, 2026 11:234,323657,672,265624,527,00023,999,00016,793,600