Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listMay 29, 2026 16:18Victor MerckléVictor MerckléScore: 2,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 16:192,56314,934,3165,095,0001,313,0002,113,536
2May 29, 2026 16:192,56614,041,5185,101,0001,315,0002,113,536
3May 29, 2026 16:192,56815,971,7395,107,0001,313,0002,113,536
4May 29, 2026 16:192,57516,335,8045,124,0001,314,0002,113,536
5May 29, 2026 16:192,58315,206,1465,140,0001,318,0002,113,536
6May 29, 2026 16:192,63817,120,2185,246,0001,350,0002,113,536
7May 29, 2026 16:192,68815,154,3425,412,0001,309,0002,113,536
8May 29, 2026 16:192,68814,578,7055,416,0001,305,0002,113,536
9May 29, 2026 16:192,74316,784,5205,518,0001,341,0002,113,536