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 listAug 14, 2026 17:03Tomislav TunkovicTomislav TunkovicScore: 3,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:033,21716,811,6816,782,0001,262,0002,121,728
2Aug 14, 2026 17:033,21816,474,7146,763,0001,282,0002,121,728
3Aug 14, 2026 17:033,23816,439,5126,821,0001,274,0002,121,728
4Aug 14, 2026 17:033,27616,626,0216,913,0001,278,0002,121,728
5Aug 14, 2026 17:033,34224,973,9107,252,0001,103,0002,121,728
6Aug 14, 2026 17:033,39016,837,8067,183,0001,292,0002,121,728
7Aug 14, 2026 17:033,39216,946,0457,202,0001,280,0002,121,728
8Aug 14, 2026 17:033,44416,815,0417,341,0001,270,0002,117,632
9Aug 14, 2026 17:033,47917,786,6087,421,0001,277,0002,121,728