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 listFeb 7, 2026 18:43T PrathamT PrathamScore: 29,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 18:4329,578100,243,63266,950,0006,994,0002,330,624
2Feb 7, 2026 18:4329,585103,192,66465,967,0007,996,0002,514,944
3Feb 7, 2026 18:4329,586100,878,91468,969,0004,997,0002,265,088
4Feb 7, 2026 18:4329,79298,416,32568,441,0006,038,0002,449,408
5Feb 7, 2026 18:4329,854100,675,55867,575,0007,060,0002,514,944
6Feb 7, 2026 18:4329,917103,768,28167,813,0006,980,0002,310,144
7Feb 7, 2026 18:4330,04199,103,65866,090,0009,012,0002,297,856
8Feb 7, 2026 18:4330,496104,962,18269,219,0007,022,0002,510,848
9Feb 7, 2026 18:4330,53299,673,71970,305,0006,026,0002,310,144