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 listApr 12, 2026 15:17limanjun99limanjun99Score: 13,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 15:1713,00260,259,13322,348,00010,158,0002,285,568
2Apr 12, 2026 15:1713,02360,068,60623,401,0009,157,0002,338,816
3Apr 12, 2026 15:1713,18762,170,40322,978,0009,990,0002,469,888
4Apr 12, 2026 15:1713,26153,127,18219,088,00014,065,0002,273,280
5Apr 12, 2026 15:1713,26357,097,33225,119,0008,038,0002,363,392
6Apr 12, 2026 15:1713,29058,300,13524,164,0009,061,0002,469,888
7Apr 12, 2026 15:1713,48659,926,65724,521,0009,195,0002,326,528
8Apr 12, 2026 15:1713,49258,338,18522,487,00011,243,0002,482,176
9Apr 12, 2026 15:1713,55665,565,50921,929,00011,961,0002,457,600