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 14, 2026 15:59Victor MerckléVictor MerckléScore: 1,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 16:001,39712,298,5422,420,0001,074,0002,117,632stderr
2Sep 14, 2026 16:001,42912,348,9952,479,0001,095,0002,117,632stderr
3Sep 14, 2026 16:001,43512,112,1322,491,0001,098,0002,117,632stderr
4Sep 14, 2026 16:001,43512,211,1722,026,0001,563,0002,117,632stderr
5Sep 14, 2026 16:001,43912,408,5192,484,0001,114,0002,117,632stderr
6Sep 14, 2026 16:001,44012,377,3952,500,0001,100,0002,117,632stderr
7Sep 14, 2026 16:001,46812,396,4952,548,0001,123,0002,117,632stderr
8Sep 14, 2026 16:001,48612,283,2682,570,0001,145,0002,117,632stderr
9Sep 14, 2026 16:001,50112,492,6612,616,0001,138,0002,117,632stderr