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 10, 2026 10:52Victor MerckléVictor MerckléScore: 2,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 10:522,57414,836,5345,198,0001,237,0002,117,632stderr
2Sep 10, 2026 10:522,57614,845,2015,205,0001,235,0002,117,632stderr
3Sep 10, 2026 10:522,59915,033,2755,397,0001,101,0002,117,632stderr
4Sep 10, 2026 10:522,60214,923,0205,398,0001,109,0002,117,632stderr
5Sep 10, 2026 10:522,61315,013,0395,264,0001,269,0002,117,632stderr
6Sep 10, 2026 10:522,64114,980,6615,362,0001,241,0002,117,632stderr
7Sep 10, 2026 10:522,64214,949,5085,367,0001,240,0002,117,632stderr
8Sep 10, 2026 10:522,64214,958,3625,504,0001,103,0002,117,632stderr
9Sep 10, 2026 10:522,65814,983,2955,533,0001,112,0002,117,632stderr