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 21, 2026 08:26Dominique GarmierDominique GarmierScore: 24,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 08:2624,67788,652,56060,698,000995,0002,510,848
2Apr 21, 2026 08:2624,69284,641,65860,719,0001,011,0002,494,464
3Apr 21, 2026 08:2624,74484,627,71559,865,0001,995,0002,490,368
4Apr 21, 2026 08:2624,76289,360,78258,911,0002,995,0002,510,848
5Apr 21, 2026 08:2624,77786,918,36158,946,0002,997,0002,494,464
6Apr 21, 2026 08:2624,82483,579,25560,060,0002,002,0002,510,848
7Apr 21, 2026 08:2624,89876,693,88359,234,0003,011,0002,506,752
8Apr 21, 2026 08:2624,90876,603,28759,257,0003,013,0002,301,952
9Apr 21, 2026 08:2625,47687,636,62562,680,0001,010,0002,506,752