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:46Andrew EpsteinAndrew EpsteinScore: 20,760Success
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:4820,7533,123,376,1633,055,712,00057,251,00016,801,792stderr
2Sep 21, 2026 14:4820,7543,125,225,6493,054,897,00058,225,00016,797,696stderr
3Sep 21, 2026 14:4820,7553,124,296,3033,056,246,00057,044,00016,797,696stderr
4Sep 21, 2026 14:4820,7583,125,046,3443,055,599,00058,151,00016,801,792stderr
5Sep 21, 2026 14:4820,7603,124,593,8633,056,954,00057,164,00016,797,696stderr
6Sep 21, 2026 14:4820,7693,126,950,3153,056,523,00058,881,00016,797,696stderr
7Sep 21, 2026 14:4820,7883,128,658,4333,060,747,00057,497,00016,801,792stderr
8Sep 21, 2026 14:4820,7883,129,274,9143,060,546,00057,671,00016,797,696stderr
9Sep 21, 2026 14:4820,7893,128,799,0803,060,893,00057,479,00016,801,792stderr