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 17, 2026 16:16Victor MerckléVictor MerckléScore: 1,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 16:181,661258,310,106241,556,0007,654,00016,797,696
2Jun 17, 2026 16:181,662258,469,969241,704,0007,685,00016,797,696
3Jun 17, 2026 16:181,662258,535,862241,732,0007,712,00016,797,696
4Jun 17, 2026 16:181,662258,464,870241,652,0007,675,00016,797,696
5Jun 17, 2026 16:181,663258,597,336241,775,0007,692,00016,797,696
6Jun 17, 2026 16:181,663258,681,435241,808,0007,761,00016,797,696
7Jun 17, 2026 16:181,668259,311,276242,413,0007,789,00016,797,696
8Jun 17, 2026 16:181,668259,389,839242,497,0007,792,00016,797,696
9Jun 17, 2026 16:181,669259,818,392242,638,0007,826,00016,797,696