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 listAug 11, 2026 09:52Tomislav TunkovicTomislav TunkovicScore: 1,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 09:521,983307,645,946288,391,0009,112,00016,801,792stderr
2Aug 11, 2026 09:521,983307,601,429288,452,0009,101,00016,801,792stderr
3Aug 11, 2026 09:521,984308,446,265288,488,0009,146,00016,801,792stderr
4Aug 11, 2026 09:521,985307,857,998288,671,0009,113,00016,801,792stderr
5Aug 11, 2026 09:521,985307,735,674288,733,0009,097,00016,801,792stderr
6Aug 11, 2026 09:521,986307,829,400288,859,0009,049,00016,801,792stderr
7Aug 11, 2026 09:521,987308,985,242288,857,0009,249,00016,801,792stderr
8Aug 11, 2026 09:521,987308,148,286289,039,0009,128,00016,801,792stderr
9Aug 11, 2026 09:521,990309,304,381289,364,0009,162,00016,801,792stderr