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:32Tomislav TunkovicTomislav TunkovicScore: 7,382Success
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:537,18226,325,05415,715,0002,240,0002,117,632
2Aug 14, 2026 14:537,18526,331,20415,732,0002,232,0002,117,632
3Aug 14, 2026 14:537,19626,101,00015,758,0002,233,0002,117,632
4Aug 14, 2026 14:537,25926,465,47615,915,0002,233,0002,117,632
5Aug 14, 2026 14:537,38226,784,06016,228,0002,228,0002,117,632
6Aug 14, 2026 14:537,46227,054,42516,429,0002,226,0002,117,632
7Aug 14, 2026 14:537,59327,441,84716,768,0002,215,0002,117,632
8Aug 14, 2026 14:537,59527,360,39616,765,0002,223,0002,117,632
9Aug 14, 2026 14:537,64627,424,46216,901,0002,216,0002,117,632