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 listApr 12, 2026 14:46limanjun99limanjun99Score: 38,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 14:4638,397122,643,61791,994,0003,999,000897,024
2Apr 12, 2026 14:4638,402129,720,13892,004,0004,000,000831,488
3Apr 12, 2026 14:4638,404119,582,30891,010,0005,000,000802,816
4Apr 12, 2026 14:4638,418127,358,10092,045,0004,001,000839,680
5Apr 12, 2026 14:4638,424119,739,76593,059,0003,001,000839,680
6Apr 12, 2026 14:4638,441126,535,03091,097,0005,005,000839,680
7Apr 12, 2026 14:4638,446124,208,49893,112,0003,003,000909,312
8Apr 12, 2026 14:4638,468120,775,64193,164,0003,005,000901,120
9Apr 12, 2026 14:4638,468121,695,64991,162,0005,008,000884,736