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 15, 2026 17:03Tomislav TunkovicTomislav TunkovicScore: 2,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 17:032,05513,473,3775,139,0000528,384stderr
2Aug 15, 2026 17:032,13614,336,1545,341,0000528,384stderr
3Aug 15, 2026 17:032,14013,683,2965,350,0000528,384stderr
4Aug 15, 2026 17:032,14113,658,7605,354,0000528,384stderr
5Aug 15, 2026 17:032,14413,608,5225,361,0000528,384stderr
6Aug 15, 2026 17:032,14413,618,6105,361,0000528,384stderr
7Aug 15, 2026 17:032,15014,161,2135,377,0000528,384stderr
8Aug 15, 2026 17:032,15214,067,1445,382,0000528,384stderr
9Aug 15, 2026 17:032,16314,277,1674,392,0001,016,000528,384stderr