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 01:42Victor MerckléVictor MerckléScore: 1,375Success
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 01:421,33712,133,3761,806,0001,538,0002,117,632stderr
2Sep 15, 2026 01:421,34212,201,3631,809,0001,548,0002,117,632stderr
3Sep 15, 2026 01:421,34612,209,7131,816,0001,551,0002,117,632stderr
4Sep 15, 2026 01:421,36712,182,0361,849,0001,570,0002,117,632stderr
5Sep 15, 2026 01:421,37512,186,9191,862,0001,576,0002,117,632stderr
6Sep 15, 2026 01:421,38212,116,0411,869,0001,587,0002,117,632stderr
7Sep 15, 2026 01:421,38711,937,2841,831,0001,638,0002,117,632stderr
8Sep 15, 2026 01:421,48212,392,9362,113,0001,593,0002,117,632stderr
9Sep 15, 2026 01:421,48912,491,5302,139,0001,584,0002,117,632stderr