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 24, 2026 16:09anboto1anboto1Score: 2,963Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 16:102,957452,760,164435,939,0007,758,00016,793,600
2Jun 24, 2026 16:102,957452,822,975435,534,0008,124,00016,793,600
3Jun 24, 2026 16:102,960453,191,702436,401,0007,684,00016,793,600
4Jun 24, 2026 16:102,963454,871,110436,860,0007,725,00016,793,600
5Jun 24, 2026 16:102,963453,788,012436,829,0007,695,00016,793,600
6Jun 24, 2026 16:102,965453,981,169437,092,0007,743,00016,793,600
7Jun 24, 2026 16:103,043465,756,174448,769,0007,786,00016,793,600
8Jun 24, 2026 16:103,651556,910,297540,070,0007,686,00016,793,600
9Jun 24, 2026 16:103,706565,077,451548,164,0007,782,00016,793,600