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 5, 2026 00:54Victor MerckléVictor MerckléScore: 1,550Success
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 01:101,45011,957,1962,551,0001,075,0002,117,632stderr
2Sep 5, 2026 01:101,47411,965,4852,587,0001,100,0002,117,632stderr
3Sep 5, 2026 01:101,52312,074,9702,688,0001,121,0002,117,632stderr
4Sep 5, 2026 01:101,53313,071,7672,718,0001,116,0002,117,632stderr
5Sep 5, 2026 01:101,55012,370,5962,757,0001,119,0002,117,632stderr
6Sep 5, 2026 01:101,56612,443,1982,790,0001,127,0002,117,632stderr
7Sep 5, 2026 01:101,56613,092,2562,788,0001,128,0002,117,632stderr
8Sep 5, 2026 01:101,57612,348,7112,802,0001,138,0002,117,632stderr
9Sep 5, 2026 01:101,63012,733,3322,942,0001,133,0002,117,632stderr