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:26Aniruddha DebAniruddha DebScore: 6,675Success
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:276,65531,706,83514,558,0002,079,0002,412,544
2Jul 1, 2025 20:276,66436,560,13613,536,0003,123,0002,301,952
3Jul 1, 2025 20:266,67041,393,44915,633,0001,042,0002,539,520
4Jul 1, 2025 20:276,67542,851,58013,559,0003,129,0002,420,736
5Jul 1, 2025 20:266,68036,617,53313,568,0003,131,0002,437,120
6Jul 1, 2025 20:266,80940,389,99715,020,0002,002,0002,433,024