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 20:17marko1597marko1597Score: 1,924Success
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 20:311,80012,970,9993,277,0001,224,0002,117,632
2Aug 14, 2026 20:311,85713,818,9663,366,0001,278,0002,117,632
3Aug 14, 2026 20:311,90612,935,0853,593,0001,174,0002,117,632
4Aug 14, 2026 20:311,90713,238,3523,497,0001,272,0002,117,632
5Aug 14, 2026 20:311,92414,506,5223,644,0001,166,0002,117,632
6Aug 14, 2026 20:311,92513,875,6483,521,0001,292,0002,117,632
7Aug 14, 2026 20:311,93613,133,8883,615,0001,226,0002,117,632
8Aug 14, 2026 20:311,93813,028,3583,671,0001,175,0002,117,632
9Aug 14, 2026 20:311,97213,163,2083,658,0001,274,0002,117,632