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 9, 2026 17:03Victor MerckléVictor MerckléScore: 3,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 17:063,47017,152,6877,443,0001,234,0002,121,728stderr
2Sep 9, 2026 17:063,48017,597,4507,457,0001,244,0002,121,728stderr
3Sep 9, 2026 17:063,48717,159,1177,472,0001,246,0002,121,728stderr
4Sep 9, 2026 17:063,49317,129,8547,489,0001,245,0002,121,728stderr
5Sep 9, 2026 17:063,49517,256,3817,340,0001,399,0002,121,728stderr
6Sep 9, 2026 17:063,49617,625,8647,480,0001,262,0002,121,728stderr
7Sep 9, 2026 17:063,49717,332,1327,468,0001,276,0002,121,728stderr
8Sep 9, 2026 17:063,50117,307,5927,477,0001,276,0002,121,728stderr
9Sep 9, 2026 17:063,50417,177,3777,510,0001,250,0002,121,728stderr