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 29, 2026 11:28Victor MerckléVictor MerckléScore: 1,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 11:301,76413,017,0343,331,0001,081,0002,117,632stderr
2Aug 29, 2026 11:301,78412,868,2963,375,0001,086,0002,117,632stderr
3Aug 29, 2026 11:301,78512,837,3443,376,0001,088,0002,117,632stderr
4Aug 29, 2026 11:301,79412,912,3323,066,0001,419,0002,117,632stderr
5Aug 29, 2026 11:301,84413,390,6683,483,0001,128,0002,117,632stderr
6Aug 29, 2026 11:301,86413,066,4893,552,0001,110,0002,117,632stderr
7Aug 29, 2026 11:301,86713,091,8523,519,0001,149,0002,117,632stderr
8Aug 29, 2026 11:301,90113,373,5683,610,0001,143,0002,117,632stderr
9Aug 29, 2026 11:301,93613,879,8923,687,0001,153,0002,117,632stderr