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 listMay 5, 2026 01:22olliecrowolliecrowScore: 3,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 01:253,75523,988,4867,030,0002,359,0002,363,392
2May 5, 2026 01:253,75626,100,1847,167,0002,224,0002,379,776
3May 5, 2026 01:253,76524,796,9237,027,0002,387,0002,367,488
4May 5, 2026 01:253,84826,344,3047,182,0002,440,0002,371,584
5May 5, 2026 01:253,97525,119,7027,502,0002,436,0002,371,584
6May 5, 2026 01:253,97726,421,4977,648,0002,295,0002,359,296
7May 5, 2026 01:253,98425,591,6537,665,0002,297,0002,375,680
8May 5, 2026 01:254,04825,903,9727,818,0002,304,0002,375,680
9May 5, 2026 01:254,14430,595,7617,660,0002,701,0002,367,488