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 17, 2026 01:39olliecrowolliecrowScore: 5,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 01:394,92828,283,1139,241,0003,080,0002,519,040
2Apr 17, 2026 01:395,03428,079,67011,536,0001,048,0002,371,584
3Apr 17, 2026 01:395,04528,923,03911,562,0001,051,0002,486,272