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 listApr 18, 2026 05:14limanjun99limanjun99Score: 3,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 05:143,125494,192,486431,714,00036,975,00016,994,304
2Apr 18, 2026 05:143,127491,940,691436,099,00033,007,00017,170,432
3Apr 18, 2026 05:143,140497,827,471427,035,00044,003,00016,998,400
4Apr 18, 2026 05:143,141494,475,568437,111,00034,008,00017,096,704
5Apr 18, 2026 05:143,143496,807,442429,486,00041,949,00017,002,496
6Apr 18, 2026 05:143,146494,108,059437,861,00033,989,00016,977,920
7Apr 18, 2026 05:143,146498,594,477422,967,00048,996,00016,994,304
8Apr 18, 2026 05:143,150495,887,064438,559,00033,965,00017,055,744
9Apr 18, 2026 05:143,156507,067,809435,479,00037,954,00016,998,400