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:30Andrew EpsteinAndrew EpsteinScore: 28,370Success
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:3228,3394,261,451,2964,176,062,00074,924,00016,797,696stderr
2Sep 21, 2026 14:3228,3554,264,316,5594,178,168,00075,146,00016,801,792stderr
3Sep 21, 2026 14:3228,3564,263,793,3544,177,899,00075,512,00016,801,792stderr
4Sep 21, 2026 14:3228,3614,264,901,4754,179,203,00075,089,00016,801,792stderr
5Sep 21, 2026 14:3228,3704,266,191,9154,179,945,00075,626,00016,801,792stderr
6Sep 21, 2026 14:3228,3814,268,030,4414,179,658,00077,603,00016,801,792stderr
7Sep 21, 2026 14:3228,3924,269,897,1534,183,565,00075,299,00016,801,792stderr
8Sep 21, 2026 14:3228,4074,272,065,3084,184,910,00076,143,00016,801,792stderr
9Sep 21, 2026 14:3228,4094,271,872,6764,186,101,00075,349,00016,801,792stderr