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 listAug 19, 2026 00:38Victor MerckléVictor MerckléScore: 2,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 00:392,46914,594,7743,631,0002,543,0002,146,304stderr
2Aug 19, 2026 00:392,48314,529,5373,771,0002,438,0002,146,304stderr
3Aug 19, 2026 00:392,49714,526,2913,778,0002,465,0002,146,304stderr
4Aug 19, 2026 00:392,57114,885,2093,975,0002,454,0002,146,304stderr
5Aug 19, 2026 00:392,57415,536,2013,906,0002,531,0002,146,304stderr
6Aug 19, 2026 00:392,59514,978,4923,915,0002,573,0002,146,304stderr
7Aug 19, 2026 00:392,61614,850,6323,947,0002,593,0002,146,304stderr
8Aug 19, 2026 00:392,64815,029,2703,980,0002,640,0002,146,304stderr
9Aug 19, 2026 00:392,65215,043,5713,994,0002,638,0002,146,304stderr