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 listSep 21, 2026 16:02Andrew EpsteinAndrew EpsteinScore: 26,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 16:0326,3143,957,588,1113,872,102,00075,096,00016,801,792stderr
2Sep 21, 2026 16:0326,3193,958,437,5353,872,781,00075,155,00016,801,792stderr
3Sep 21, 2026 16:0326,3223,959,565,4003,872,147,00076,289,00016,801,792stderr
4Sep 21, 2026 16:0326,3233,959,787,7803,871,883,00076,672,00016,801,792stderr
5Sep 21, 2026 16:0326,3243,962,290,5473,872,730,00075,986,00016,801,792stderr
6Sep 21, 2026 16:0326,3283,959,736,1753,873,794,00075,487,00016,801,792stderr
7Sep 21, 2026 16:0326,3643,965,060,3673,879,346,00075,396,00016,801,792stderr
8Sep 21, 2026 16:0326,3653,965,224,1963,879,121,00075,747,00016,801,792stderr
9Sep 21, 2026 16:0326,3683,965,636,5373,879,558,00075,695,00016,801,792stderr