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 05:29Victor MerckléVictor MerckléScore: 1,473Success
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 05:301,41412,396,1201,987,0001,550,0002,117,632stderr
2Sep 15, 2026 05:301,42112,267,3491,972,0001,582,0002,117,632stderr
3Sep 15, 2026 05:301,42212,348,8162,025,0001,531,0002,117,632stderr
4Sep 15, 2026 05:301,46912,456,2412,121,0001,553,0002,117,632stderr
5Sep 15, 2026 05:301,47313,160,7132,537,0001,146,0002,117,632stderr
6Sep 15, 2026 05:301,48712,459,6872,146,0001,572,0002,117,632stderr
7Sep 15, 2026 05:301,49212,639,8172,570,0001,160,0002,117,632stderr
8Sep 15, 2026 05:301,50012,482,8452,589,0001,163,0002,117,632stderr
9Sep 15, 2026 05:301,50112,444,6522,597,0001,157,0002,117,632stderr