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 14, 2026 16:24Victor MerckléVictor MerckléScore: 1,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 16:251,51212,477,5232,713,0001,068,0002,117,632stderr
2Sep 14, 2026 16:251,55312,484,8522,785,0001,098,0002,117,632stderr
3Sep 14, 2026 16:251,55512,453,1572,791,0001,098,0002,117,632stderr
4Sep 14, 2026 16:251,72113,002,5302,874,0001,430,0002,117,632stderr
5Sep 14, 2026 16:251,72313,059,9953,216,0001,092,0002,117,632stderr
6Sep 14, 2026 16:251,73013,119,9993,221,0001,104,0002,117,632stderr
7Sep 14, 2026 16:251,76413,100,2293,311,0001,100,0002,117,632stderr
8Sep 14, 2026 16:251,77013,730,1763,299,0001,126,0002,117,632stderr
9Sep 14, 2026 16:251,77313,784,1143,294,0001,139,0002,117,632stderr