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 20, 2026 16:47BenBenScore: 27,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:5127,09594,608,66262,759,0004,980,0002,297,856
2Apr 20, 2026 16:5127,56888,457,98959,932,0008,989,0002,265,088
3Apr 20, 2026 16:5127,59394,639,32058,986,0009,997,0002,285,568