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 10:19Victor MerckléVictor MerckléScore: 1,738Success
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 10:211,64112,503,7303,020,0001,084,0002,117,632stderr
2Aug 29, 2026 10:211,69412,581,7603,092,0001,145,0002,117,632stderr
3Aug 29, 2026 10:211,70112,664,0213,028,0001,225,0002,117,632stderr
4Aug 29, 2026 10:211,71212,647,2663,151,0001,130,0002,117,632stderr
5Aug 29, 2026 10:211,73813,118,4303,222,0001,124,0002,117,632stderr
6Aug 29, 2026 10:211,74712,754,3503,233,0001,136,0002,117,632stderr
7Aug 29, 2026 10:211,76913,409,7703,265,0001,159,0002,117,632stderr
8Aug 29, 2026 10:211,80512,916,7043,401,0001,112,0002,117,632stderr
9Aug 29, 2026 10:211,85423,045,0043,411,0001,225,0002,117,632stderr