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 5, 2026 22:31Elijah KinElijah KinScore: 2,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 22:322,44515,173,3654,803,0001,311,0002,117,632
2Jun 5, 2026 22:322,45815,232,8785,036,0001,111,0002,117,632
3Jun 5, 2026 22:322,46415,214,8855,054,0001,108,0002,117,632
4Jun 5, 2026 22:322,49015,279,4465,112,0001,113,0002,117,632
5Jun 5, 2026 22:322,62115,600,2275,459,0001,095,0002,117,632
6Jun 5, 2026 22:322,63715,629,8315,480,0001,113,0002,117,632
7Jun 5, 2026 22:322,66615,689,5955,561,0001,106,0002,117,632
8Jun 5, 2026 22:322,66815,840,4765,576,0001,094,0002,117,632
9Jun 5, 2026 22:322,77016,050,6305,815,0001,111,0002,117,632