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 26, 2026 20:23TudyMTudyMScore: 385,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 20:23384,938985,780,682960,348,0001,998,0002,555,904
2Apr 26, 2026 20:23384,961980,663,724960,406,0001,998,0002,555,904
3Apr 26, 2026 20:23385,001978,114,516960,505,0001,998,0002,351,104
4Apr 26, 2026 20:23385,021980,273,139960,555,0001,999,0002,560,000
5Apr 26, 2026 20:23385,053983,542,053959,635,0002,998,0002,551,808
6Apr 26, 2026 20:23385,077982,391,700961,695,000999,0002,551,808
7Apr 26, 2026 20:23385,090979,566,523960,728,0001,999,0002,555,904
8Apr 26, 2026 20:23385,103980,571,048960,760,0001,999,0002,555,904
9Apr 26, 2026 20:23385,109982,249,803959,774,0002,999,0002,359,296