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 12, 2026 05:26Victor MerckléVictor MerckléScore: 1,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 05:271,712267,292,723249,249,0007,663,00016,797,696
2Jun 12, 2026 05:271,713266,157,554249,351,0007,740,00016,797,696
3Jun 12, 2026 05:271,713266,219,338249,275,0007,769,00016,797,696
4Jun 12, 2026 05:271,713266,255,426249,241,0007,804,00016,797,696
5Jun 12, 2026 05:271,714266,364,800249,512,0007,715,00016,797,696
6Jun 12, 2026 05:271,715266,459,196249,398,0007,938,00016,797,696
7Jun 12, 2026 05:271,719267,374,585250,060,0007,881,00016,797,696
8Jun 12, 2026 05:271,720267,122,896250,259,0007,823,00016,797,696
9Jun 12, 2026 05:271,721267,348,455250,328,0007,862,00016,797,696