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 14:14Andrew EpsteinAndrew EpsteinScore: 18,686Success
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 14:1518,6692,810,860,5582,736,157,00064,278,00016,801,792stderr
2Sep 21, 2026 14:1518,6782,812,109,7692,737,691,00064,035,00016,801,792stderr
3Sep 21, 2026 14:1518,6782,812,273,3822,737,191,00064,646,00016,801,792stderr
4Sep 21, 2026 14:1518,6812,813,311,7802,738,383,00063,907,00016,797,696stderr
5Sep 21, 2026 14:1518,6862,813,966,4382,738,388,00064,536,00016,797,696stderr
6Sep 21, 2026 14:1518,6892,814,617,1202,737,473,00065,959,00016,801,792stderr
7Sep 21, 2026 14:1518,7252,819,025,5532,744,077,00064,695,00016,797,696stderr
8Sep 21, 2026 14:1518,7372,820,987,5992,746,135,00064,438,00016,801,792stderr
9Sep 21, 2026 14:1518,7372,821,579,6662,746,292,00064,305,00016,801,792stderr