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 listJun 14, 2026 00:12Victor MerckléVictor MerckléScore: 6,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 00:125,75523,617,02411,174,0003,214,0002,117,632
2Jun 14, 2026 00:126,16324,614,78712,169,0003,240,0002,117,632
3Jun 14, 2026 00:126,17824,604,09012,246,0003,200,0002,117,632
4Jun 14, 2026 00:126,19924,738,69612,307,0003,192,0002,117,632
5Jun 14, 2026 00:126,21824,717,21512,329,0003,216,0002,117,632
6Jun 14, 2026 00:126,26324,815,49112,422,0003,237,0002,117,632
7Jun 14, 2026 00:126,47725,469,54012,969,0003,225,0002,117,632
8Jun 14, 2026 00:126,50425,365,73013,045,0003,215,0002,117,632
9Jun 14, 2026 00:126,56025,599,45713,126,0003,276,0002,117,632