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 19, 2026 04:51Victor MerckléVictor MerckléScore: 1,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 04:521,652257,076,202240,071,0007,832,00016,797,696
2Jun 19, 2026 04:521,652256,963,953240,060,0007,844,00016,797,696
3Jun 19, 2026 04:521,653257,211,603240,180,0007,896,00016,797,696
4Jun 19, 2026 04:521,653257,091,342240,077,0007,917,00016,797,696
5Jun 19, 2026 04:521,653257,110,882240,120,0007,897,00016,797,696
6Jun 19, 2026 04:521,654257,273,279240,218,0007,961,00016,797,696
7Jun 19, 2026 04:521,657257,752,604240,769,0007,918,00016,797,696
8Jun 19, 2026 04:521,659258,078,553240,956,0007,978,00016,797,696
9Jun 19, 2026 04:521,659258,053,334241,000,0007,962,00016,797,696