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 listApr 18, 2026 15:58Charles CabergsCharles CabergsScore: 4,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 15:584,410683,627,326634,491,00026,978,00017,166,336
2Apr 18, 2026 15:584,415689,583,149640,289,00021,975,00017,035,264
3Apr 18, 2026 15:584,419687,236,199635,844,00026,993,00017,014,784
4Apr 18, 2026 15:584,429689,369,675640,375,00023,976,00017,170,432
5Apr 18, 2026 15:584,469699,301,583641,363,00028,971,00017,166,336
6Apr 18, 2026 15:584,534709,634,452651,060,00029,002,00017,158,144
7Apr 18, 2026 15:584,535707,567,952657,203,00022,972,00017,117,184
8Apr 18, 2026 15:584,551703,250,959656,649,00025,986,00017,162,240
9Apr 18, 2026 15:584,557710,694,596655,552,00027,980,00017,158,144