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 listJun 24, 2026 10:37anboto1anboto1Score: 4,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:384,696714,458,441683,201,00021,320,00016,793,600
2Jun 24, 2026 10:384,700714,762,567683,761,00021,388,00016,793,600
3Jun 24, 2026 10:384,706715,372,149684,808,00021,219,00016,793,600
4Jun 24, 2026 10:384,707715,237,947684,745,00021,305,00016,793,600
5Jun 24, 2026 10:384,709715,624,650684,779,00021,632,00016,793,600
6Jun 24, 2026 10:384,709715,698,061684,934,00021,522,00016,793,600
7Jun 24, 2026 10:384,755722,597,052691,814,00021,554,00016,793,600
8Jun 24, 2026 10:384,842735,570,918706,548,00019,759,00016,793,600
9Jun 24, 2026 10:384,897743,831,798713,487,00021,095,00016,793,600