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:43olliecrowolliecrowScore: 4,973Success
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:434,92628,260,23910,264,0002,052,0002,465,792
2Apr 17, 2026 01:434,97326,167,90711,397,0001,036,0002,347,008
3Apr 17, 2026 01:435,11135,223,9469,584,0003,194,0002,502,656