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 listJul 1, 2025 20:35Aniruddha DebAniruddha DebScore: 6,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2025 20:356,24030,952,44312,480,0003,120,0002,412,544
2Jul 1, 2025 20:356,25235,014,74912,504,0003,126,0002,531,328
3Jul 1, 2025 20:356,25848,176,85413,560,0002,086,0002,277,376
4Jul 1, 2025 20:356,26341,866,13411,482,0004,175,0002,420,736
5Jul 1, 2025 20:356,27144,820,01712,543,0003,135,0002,269,184
6Jul 1, 2025 20:356,27443,612,00811,502,0004,182,0002,539,520
7Jul 1, 2025 20:356,27542,532,77412,550,0003,137,0002,367,488
8Jul 1, 2025 20:356,27639,843,76512,553,0003,138,0002,269,184
9Jul 1, 2025 20:356,27733,130,63312,554,0003,138,0002,539,520
10Jul 1, 2025 20:356,29841,747,85312,596,0003,149,0002,539,520
11Jul 1, 2025 20:356,36733,258,55611,939,0003,979,0002,293,760
12Jul 1, 2025 20:357,01840,967,75014,449,0003,096,0002,416,640