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 26, 2026 05:12Charles CabergsCharles CabergsScore: 3,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:133,844593,561,220568,628,0007,994,00017,207,296
2Apr 26, 2026 05:133,847589,925,333568,173,0009,002,00017,076,224
3Apr 26, 2026 05:133,847594,372,409567,110,00010,001,00016,998,400
4Apr 26, 2026 05:133,848595,116,002568,302,0009,004,00017,084,416
5Apr 26, 2026 05:133,848593,249,284567,221,00010,003,00017,141,760
6Apr 26, 2026 05:133,849598,287,711566,372,00010,987,00017,039,360
7Apr 26, 2026 05:133,852592,642,382568,923,0008,998,00017,068,032
8Apr 26, 2026 05:133,853594,213,364569,054,0009,000,00017,076,224
9Apr 26, 2026 05:133,853595,741,753569,019,0009,000,00017,121,280