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 10, 2026 08:34Victor MerckléVictor MerckléScore: 1,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 08:361,46412,351,9482,583,0001,078,0002,117,632stderr
2Sep 10, 2026 08:361,49012,201,1432,605,0001,122,0002,117,632stderr
3Sep 10, 2026 08:361,56113,177,6512,767,0001,136,0002,117,632stderr
4Sep 10, 2026 08:361,56312,432,6022,768,0001,140,0002,117,632stderr
5Sep 10, 2026 08:361,56413,213,0892,777,0001,135,0002,117,632stderr
6Sep 10, 2026 08:361,56413,239,5862,800,0001,110,0002,117,632stderr
7Sep 10, 2026 08:361,56412,309,8072,759,0001,151,0002,117,632stderr
8Sep 10, 2026 08:361,57212,526,2362,784,0001,148,0002,117,632stderr
9Sep 10, 2026 08:361,58012,302,8112,797,0001,155,0002,117,632stderr