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:14T PrathamT PrathamScore: 8,736Success
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:148,46645,061,21118,142,0003,023,0002,379,776
2Feb 7, 2026 21:148,50644,104,74917,215,0004,050,0002,273,280
3Feb 7, 2026 21:148,50953,510,45216,208,0005,065,0002,326,528
4Feb 7, 2026 21:148,58453,495,49314,307,0007,153,0002,293,760
5Feb 7, 2026 21:148,73649,195,21815,885,0005,956,0002,482,176
6Feb 7, 2026 21:148,74850,467,35615,905,0005,964,0002,342,912
7Feb 7, 2026 21:148,75847,196,90516,919,0004,976,0002,482,176
8Feb 7, 2026 21:148,87245,940,20118,148,0004,032,0002,269,184
9Feb 7, 2026 21:148,88945,967,53519,193,0003,030,0002,453,504