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 21:33Yuriy LyfenkoYuriy LyfenkoScore: 3,934Success
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 21:333,931612,723,977565,694,00023,987,00017,170,432
2Mar 21, 2026 21:333,931609,199,218566,651,00022,985,00017,084,416
3Mar 21, 2026 21:333,934614,640,938567,038,00023,001,00016,994,304
4Mar 21, 2026 21:333,934612,851,076567,031,00023,001,00016,969,728
5Mar 21, 2026 21:333,935614,709,077566,184,00024,007,00017,108,992
6Mar 21, 2026 21:333,936619,028,793567,416,00022,976,00016,949,248