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 03:40limanjun99limanjun99Score: 4,623Success
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 03:404,611712,326,083667,722,00023,990,00017,174,528
2Apr 18, 2026 03:404,615723,803,648676,267,00016,006,00017,203,200
3Apr 18, 2026 03:404,616718,271,334668,430,00023,979,00016,949,248
4Apr 18, 2026 03:404,619717,752,444668,914,00023,996,00017,068,032
5Apr 18, 2026 03:404,623718,393,246673,538,00019,986,00017,166,336
6Apr 18, 2026 03:404,629722,090,608677,426,00016,985,00017,047,552
7Apr 18, 2026 03:404,630721,029,688669,486,00024,980,00017,092,608
8Apr 18, 2026 03:404,632719,178,742671,836,00022,994,00017,117,184
9Apr 18, 2026 03:404,677725,090,020683,497,00017,986,00017,068,032