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:32Aniruddha DebAniruddha DebScore: 6,286Success
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:326,25535,265,09012,511,0003,127,0002,539,520
2Jul 1, 2025 20:326,27534,010,12813,596,0002,091,0002,412,544
3Jul 1, 2025 20:326,28030,521,75212,561,0003,140,0002,416,640
4Jul 1, 2025 20:326,28241,568,05013,612,0002,094,0002,424,832
5Jul 1, 2025 20:326,28631,583,93811,524,0004,190,0002,412,544
6Jul 1, 2025 20:326,29133,612,34113,630,0002,097,0002,531,328
7Jul 1, 2025 20:326,36229,935,55012,922,0002,982,0002,428,928
8Jul 1, 2025 20:326,36434,586,62411,932,0003,977,0002,531,328
9Jul 1, 2025 20:327,71244,288,27715,221,0004,058,0002,531,328