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 listAug 29, 2026 13:02Victor MerckléVictor MerckléScore: 1,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:041,59812,372,4492,868,0001,127,0002,117,632stderr
2Aug 29, 2026 13:041,63112,475,7162,831,0001,247,0002,117,632stderr
3Aug 29, 2026 13:041,67812,557,0023,043,0001,152,0002,117,632stderr
4Aug 29, 2026 13:041,67912,600,9793,049,0001,149,0002,117,632stderr
5Aug 29, 2026 13:041,68312,583,8373,071,0001,138,0002,117,632stderr
6Aug 29, 2026 13:041,68413,324,2533,069,0001,142,0002,117,632stderr
7Aug 29, 2026 13:041,68712,579,1673,078,0001,140,0002,117,632stderr
8Aug 29, 2026 13:041,68812,608,1863,066,0001,154,0002,117,632stderr
9Aug 29, 2026 13:041,69013,918,4573,078,0001,148,0002,117,632stderr