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 02:11Elijah KinElijah KinScore: 2,342Success
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 02:122,08814,339,8753,962,0001,258,0002,117,632
2Jun 8, 2026 02:122,08814,288,5863,962,0001,258,0002,117,632
3Jun 8, 2026 02:122,09614,393,6373,986,0001,255,0002,117,632
4Jun 8, 2026 02:122,11114,397,6544,012,0001,266,0002,117,632
5Jun 8, 2026 02:122,34214,912,0844,610,0001,247,0002,117,632
6Jun 8, 2026 02:122,35015,011,3714,739,0001,138,0002,117,632
7Jun 8, 2026 02:122,36515,011,3534,639,0001,274,0002,117,632
8Jun 8, 2026 02:122,41015,037,1974,744,0001,283,0002,117,632
9Jun 8, 2026 02:122,41215,483,1674,741,0001,289,0002,117,632