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 19:21Victor MerckléVictor MerckléScore: 2,632Success
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 19:222,57316,217,0625,121,0001,312,0002,113,536
2May 29, 2026 19:222,58214,751,5465,147,0001,310,0002,113,536
3May 29, 2026 19:222,59016,605,4605,163,0001,314,0002,113,536
4May 29, 2026 19:222,59515,047,5015,173,0001,315,0002,113,536
5May 29, 2026 19:222,63215,397,1315,255,0001,327,0002,113,536
6May 29, 2026 19:222,66414,888,9585,317,0001,344,0002,113,536
7May 29, 2026 19:222,68214,462,7925,396,0001,309,0002,113,536
8May 29, 2026 19:222,69415,898,7105,425,0001,312,0002,113,536
9May 29, 2026 19:222,77714,693,7464,677,0002,267,0002,113,536