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 15:23Elijah KinElijah KinScore: 2,370Success
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 15:242,05314,180,3783,884,0001,249,0002,117,632
2Jun 8, 2026 15:242,05714,234,8403,911,0001,232,0002,117,632
3Jun 8, 2026 15:242,06014,295,7283,914,0001,236,0002,117,632
4Jun 8, 2026 15:242,08014,191,3363,950,0001,251,0002,117,632
5Jun 8, 2026 15:242,37015,384,8024,660,0001,267,0002,117,632
6Jun 8, 2026 15:242,38015,113,0954,700,0001,252,0002,117,632
7Jun 8, 2026 15:242,39515,025,1974,724,0001,265,0002,117,632
8Jun 8, 2026 15:242,40215,109,0604,752,0001,255,0002,117,632
9Jun 8, 2026 15:242,40315,559,7754,902,0001,107,0002,117,632