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 03:16Charles CabergsCharles CabergsScore: 6,335Success
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 03:166,149950,860,080892,392,00029,946,00016,977,920
2Apr 18, 2026 03:166,237963,330,172903,549,00031,948,00016,961,536
3Apr 18, 2026 03:166,321971,303,375921,150,00026,975,00017,084,416
4Apr 18, 2026 03:166,334980,619,130922,112,00027,973,00016,961,536
5Apr 18, 2026 03:166,335977,209,177926,222,00023,979,00017,137,664
6Apr 18, 2026 03:166,360980,211,585928,055,00025,973,00017,084,416
7Apr 18, 2026 03:166,361982,976,188928,219,00025,978,00017,162,240
8Apr 18, 2026 03:166,369984,292,968929,406,00025,983,00017,190,912
9Apr 18, 2026 03:166,389985,563,913929,425,00028,982,00016,965,632