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 20, 2025 08:13Aniruddha DebAniruddha DebScore: 15,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2025 08:1315,34961,316,65931,304,0007,068,0002,269,184
2Apr 20, 2025 08:1315,36661,018,54233,361,0005,054,0002,531,328
3Apr 20, 2025 08:1315,37060,782,15430,336,0008,089,0002,469,888
4Apr 20, 2025 08:1315,45964,840,37929,494,0009,153,0002,371,584
5Apr 20, 2025 08:1315,49169,185,09329,555,0009,172,0002,265,088
6Apr 20, 2025 08:1315,55063,569,44631,897,0006,977,0002,519,040
7Apr 20, 2025 08:1315,63664,213,58531,071,0008,018,0002,535,424
8Apr 20, 2025 08:1315,68161,410,56728,146,00011,057,0002,441,216
9Apr 20, 2025 08:1315,83261,027,64831,462,0008,119,0002,334,720