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 listDec 30, 2025 23:25Aniruddha DebAniruddha DebScore: 3,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 23:253,34228,697,3517,311,0001,044,0002,273,280
2Dec 30, 2025 23:253,35223,844,0697,333,0001,047,0002,428,928
3Dec 30, 2025 23:253,36223,934,4957,355,0001,050,0002,420,736
4Dec 30, 2025 23:253,37527,869,9346,329,0002,109,0002,277,376
5Dec 30, 2025 23:253,37628,117,0957,386,0001,055,0002,277,376
6Dec 30, 2025 23:253,38324,128,6696,344,0002,114,0002,428,928
7Dec 30, 2025 23:253,39223,193,0996,361,0002,120,0002,277,376
8Dec 30, 2025 23:253,44524,079,7007,536,0001,076,0002,420,736
9Dec 30, 2025 23:253,47224,925,9455,426,0003,255,0002,277,376