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 listAug 13, 2026 15:10Yehor BondarYehor BondarScore: 28,693Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 15:1428,64781,523,95070,422,0001,196,0002,113,536
2Aug 13, 2026 15:1428,65081,580,80170,424,0001,203,0002,113,536
3Aug 13, 2026 15:1428,66081,512,62170,450,0001,201,0002,113,536
4Aug 13, 2026 15:1428,69281,549,18570,445,0001,285,0002,113,536
5Aug 13, 2026 15:1428,69381,577,19170,449,0001,284,0002,113,536
6Aug 13, 2026 15:1428,69581,651,54470,731,0001,008,0002,113,536
7Aug 13, 2026 15:1428,69681,617,95870,455,0001,285,0002,113,536
8Aug 13, 2026 15:1428,70481,611,07670,563,0001,197,0002,113,536
9Aug 13, 2026 15:1428,72181,629,71170,605,0001,198,0002,113,536