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:26TudyMTudyMScore: 320,886Success
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:27320,614821,349,589799,539,0001,998,0002,560,000
2Apr 26, 2026 20:27320,625822,076,556799,566,0001,998,0002,551,808
3Apr 26, 2026 20:27320,670820,700,202798,678,0002,998,0002,293,760
4Apr 26, 2026 20:27320,880819,853,480800,201,0002,000,0002,383,872
5Apr 26, 2026 20:27320,886822,162,171801,216,0001,000,0002,551,808
6Apr 26, 2026 20:27320,940820,463,816799,355,0002,997,0002,330,624
7Apr 26, 2026 20:27321,021821,766,817799,556,0002,998,0002,297,856
8Apr 26, 2026 20:27321,028819,447,259800,573,0001,998,0002,551,808
9Apr 26, 2026 20:27321,051818,773,787799,631,0002,998,0002,297,856