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 21:50T PrathamT PrathamScore: 8,985Success
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 21:508,90046,226,00019,215,0003,034,0002,318,336
2Feb 7, 2026 21:508,98545,998,23813,274,0009,189,0002,498,560
3Feb 7, 2026 21:509,36243,688,17918,318,0005,088,0002,523,136