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 02:31olliecrowolliecrowScore: 5,315Success
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 02:315,10136,773,04611,690,0001,062,0002,347,008
2Apr 17, 2026 02:315,31531,663,06610,221,0003,066,0002,342,912
3Apr 17, 2026 02:315,44434,288,0638,376,0005,235,0002,334,720