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 00:40Victor MerckléVictor MerckléScore: 1,456Success
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 00:431,34712,071,4221,821,0001,548,0002,117,632stderr
2Sep 15, 2026 00:431,40412,212,1761,920,0001,591,0002,117,632stderr
3Sep 15, 2026 00:431,40512,314,9841,982,0001,531,0002,117,632stderr
4Sep 15, 2026 00:431,45113,931,9782,007,0001,622,0002,117,632stderr
5Sep 15, 2026 00:431,45612,546,6542,118,0001,524,0002,117,632stderr
6Sep 15, 2026 00:431,47612,396,0022,135,0001,555,0002,117,632stderr
7Sep 15, 2026 00:431,47812,435,7502,113,0001,582,0002,117,632stderr
8Sep 15, 2026 00:431,48212,751,8842,154,0001,552,0002,117,632stderr
9Sep 15, 2026 00:431,49612,318,2382,156,0001,584,0002,117,632stderr