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 22, 2026 09:45M-RochatM-RochatScore: 4,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 09:454,55721,418,33010,303,0001,090,0002,121,728
2May 22, 2026 09:454,56320,770,36610,320,0001,088,0002,117,632
3May 22, 2026 09:454,57123,303,62210,339,0001,090,0002,117,632
4May 22, 2026 09:454,67120,903,66110,580,0001,098,0002,121,728
5May 22, 2026 09:454,67420,930,38910,588,0001,098,0002,117,632
6May 22, 2026 09:454,68821,499,84210,620,0001,101,0002,117,632
7May 22, 2026 09:454,70521,571,36710,663,0001,100,0002,117,632
8May 22, 2026 09:454,71021,635,51010,675,0001,102,0002,117,632
9May 22, 2026 09:454,71321,201,23910,683,0001,101,0002,117,632