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 14:28Tomislav TunkovicTomislav TunkovicScore: 7,726Success
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 14:497,36227,878,99415,145,0003,262,0002,117,632
2Aug 14, 2026 14:497,55027,106,09015,608,0003,267,0002,117,632
3Aug 14, 2026 14:497,56727,277,43215,631,0003,287,0002,117,632
4Aug 14, 2026 14:497,70727,571,96815,978,0003,291,0002,117,632
5Aug 14, 2026 14:497,72627,663,42916,073,0003,244,0002,117,632
6Aug 14, 2026 14:497,75227,788,49916,110,0003,270,0002,117,632
7Aug 14, 2026 14:497,75327,695,30816,120,0003,264,0002,117,632
8Aug 14, 2026 14:497,78427,781,88816,179,0003,281,0002,117,632
9Aug 14, 2026 14:497,82227,907,14916,311,0003,246,0002,117,632