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 listMar 21, 2026 13:58limanjun99limanjun99Score: 4,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 13:584,874758,028,134710,061,00020,972,00016,998,400
2Mar 21, 2026 13:584,900761,153,711716,020,00018,974,00016,957,440
3Mar 21, 2026 13:584,928768,298,037720,293,00018,981,00016,986,112
4Mar 21, 2026 13:584,934764,388,460727,133,00012,984,00016,994,304
5Mar 21, 2026 13:584,944773,264,293728,625,00012,993,00017,084,416
6Mar 21, 2026 13:584,979777,710,169728,905,00017,973,00017,162,240
7Mar 21, 2026 13:585,022783,763,564734,340,00018,982,00017,076,224
8Mar 21, 2026 13:585,092796,115,056744,841,00018,970,00017,100,800
9Mar 21, 2026 13:585,831916,330,200861,742,00012,891,00016,965,632