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 listJun 8, 2026 23:26Elijah KinElijah KinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 23:27017,593,9765,416,0001,389,0002,117,632pos 10: expected 82 got 81
2Jun 8, 2026 23:27016,137,5525,538,0001,334,0002,117,632pos 10: expected 143 got 142
3Jun 8, 2026 23:27015,646,9005,046,0001,354,0002,117,632pos 10: expected 162 got 161