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:02Tomislav TunkovicTomislav TunkovicScore: 11,985Success
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:0811,91637,992,28023,662,0006,128,0002,117,632
2Aug 14, 2026 14:0811,91738,219,64523,658,0006,135,0002,117,632
3Aug 14, 2026 14:0811,93438,204,51623,678,0006,157,0002,117,632
4Aug 14, 2026 14:0811,96038,091,04523,712,0006,188,0002,117,632
5Aug 14, 2026 14:0811,98538,149,47123,756,0006,208,0002,117,632
6Aug 14, 2026 14:0812,03338,225,84523,726,0006,357,0002,117,632
7Aug 14, 2026 14:0812,12840,510,46124,139,0006,183,0002,117,632
8Aug 14, 2026 14:0812,13938,707,03824,017,0006,332,0002,117,632
9Aug 14, 2026 14:0812,15038,588,69124,019,0006,357,0002,117,632