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 13:29Andrew EpsteinAndrew EpsteinScore: 31,446Success
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 13:3031,3824,717,845,0434,469,111,000238,221,00016,797,696stderr
2Sep 21, 2026 13:3031,3874,718,806,9284,468,664,000239,497,00016,801,792stderr
3Sep 21, 2026 13:3031,4184,723,403,7464,473,583,000239,253,00016,801,792stderr
4Sep 21, 2026 13:3031,4354,726,848,7564,477,564,000237,726,00016,801,792stderr
5Sep 21, 2026 13:3031,4464,729,660,0604,476,054,000240,872,00016,797,696stderr
6Sep 21, 2026 13:3031,4484,727,757,0994,479,781,000237,476,00016,797,696stderr
7Sep 21, 2026 13:3031,4524,728,695,5654,468,652,000249,177,00016,797,696stderr
8Sep 21, 2026 13:3031,5194,739,474,3524,481,750,000246,231,00016,797,696stderr
9Sep 21, 2026 13:3031,6694,761,782,5564,497,754,000252,606,00016,797,696stderr