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:47anboto1anboto1Score: 3,451Success
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:483,437524,799,758486,626,00028,995,00016,793,600
2Jun 24, 2026 11:483,439525,155,371487,443,00028,541,00016,793,600
3Jun 24, 2026 11:483,442525,590,815486,763,00029,639,00016,793,600
4Jun 24, 2026 11:483,447526,331,242488,313,00028,853,00016,793,600
5Jun 24, 2026 11:483,451526,988,605487,673,00030,119,00016,793,600
6Jun 24, 2026 11:483,452526,950,648488,253,00029,585,00016,793,600
7Jun 24, 2026 11:483,453527,270,053488,471,00029,592,00016,793,600
8Jun 24, 2026 11:483,459528,171,305487,593,00031,343,00016,793,600
9Jun 24, 2026 11:483,459528,181,134488,921,00030,040,00016,793,600