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:25Victor 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 14, 2026 15:261,37412,273,2091,965,0001,471,0002,117,632stderr
2Sep 14, 2026 15:261,40412,379,4922,451,0001,060,0002,117,632stderr
3Sep 14, 2026 15:261,41812,226,5552,007,0001,539,0002,117,632stderr
4Sep 14, 2026 15:261,44812,315,7822,117,0001,504,0002,117,632stderr
5Sep 14, 2026 15:261,45612,660,1992,121,0001,521,0002,117,632stderr
6Sep 14, 2026 15:261,46012,536,8262,108,0001,543,0002,117,632stderr
7Sep 14, 2026 15:261,47212,454,7982,175,0001,507,0002,117,632stderr
8Sep 14, 2026 15:261,48812,434,6102,175,0001,547,0002,117,632stderr
9Sep 14, 2026 15:261,49612,441,1562,616,0001,125,0002,117,632stderr