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 listSep 15, 2026 09:35Victor MerckléVictor MerckléScore: 1,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 09:411,44312,217,9902,458,0001,150,0002,117,632stderr
2Sep 15, 2026 09:411,46913,111,4292,137,0001,537,0002,117,632stderr
3Sep 15, 2026 09:411,47112,463,6132,099,0001,580,0002,117,632stderr
4Sep 15, 2026 09:411,47412,469,8372,112,0001,573,0002,117,632stderr
5Sep 15, 2026 09:411,48412,624,4812,151,0001,560,0002,117,632stderr
6Sep 15, 2026 09:411,48912,436,3682,152,0001,572,0002,117,632stderr
7Sep 15, 2026 09:411,49212,375,4352,567,0001,164,0002,117,632stderr
8Sep 15, 2026 09:411,50012,394,3952,583,0001,168,0002,117,632stderr
9Sep 15, 2026 09:411,50112,337,2122,576,0001,178,0002,117,632stderr