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 15, 2026 09:15Victor MerckléVictor MerckléScore: 1,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 09:151,34512,126,5671,841,0001,523,0002,117,632stderr
2Sep 15, 2026 09:151,37712,238,6521,896,0001,547,0002,117,632stderr
3Sep 15, 2026 09:151,39212,190,5241,873,0001,609,0002,117,632stderr
4Sep 15, 2026 09:151,43412,318,3772,015,0001,572,0002,117,632stderr
5Sep 15, 2026 09:151,45112,407,2072,496,0001,132,0002,117,632stderr
6Sep 15, 2026 09:151,48813,133,2382,581,0001,139,0002,117,632stderr
7Sep 15, 2026 09:151,50112,440,5752,163,0001,591,0002,117,632stderr
8Sep 15, 2026 09:151,50612,512,9722,155,0001,611,0002,117,632stderr
9Sep 15, 2026 09:151,51512,507,3892,167,0001,622,0002,117,632stderr