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:01anboto1anboto1Score: 3,009Success
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:023,005460,071,936438,818,00012,075,00016,797,696
2Jun 24, 2026 15:023,007460,510,351439,054,00012,076,00016,797,696
3Jun 24, 2026 15:023,008460,475,393439,044,00012,180,00016,797,696
4Jun 24, 2026 15:023,008460,344,322439,427,00011,775,00016,797,696
5Jun 24, 2026 15:023,009460,858,343439,268,00012,128,00016,797,696
6Jun 24, 2026 15:023,009460,716,163439,391,00012,092,00016,797,696
7Jun 24, 2026 15:023,011460,752,453439,969,00011,696,00016,797,696
8Jun 24, 2026 15:023,014462,262,429440,143,00012,105,00016,797,696
9Jun 24, 2026 15:023,015461,474,353440,401,00011,856,00016,797,696