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 4, 2026 23:49Victor MerckléVictor MerckléScore: 3,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 00:162,99615,991,8865,378,0002,112,0002,117,632stderr
2Sep 5, 2026 00:162,99815,820,1225,386,0002,109,0002,117,632stderr
3Sep 5, 2026 00:163,01115,703,5705,363,0002,165,0002,117,632stderr
4Sep 5, 2026 00:163,02016,060,8915,374,0002,176,0002,117,632stderr
5Sep 5, 2026 00:163,03218,247,7005,369,0002,213,0002,117,632stderr
6Sep 5, 2026 00:163,03416,129,2215,365,0002,221,0002,117,632stderr
7Sep 5, 2026 00:163,03615,923,4565,389,0002,201,0002,117,632stderr
8Sep 5, 2026 00:163,05416,069,8095,474,0002,163,0002,117,632stderr
9Sep 5, 2026 00:163,08716,143,9115,511,0002,207,0002,117,632stderr