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 listApr 13, 2026 08:43limanjun99limanjun99Score: 3,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 08:433,16127,266,3285,927,0001,975,0002,289,664
2Apr 13, 2026 08:433,16529,228,5995,934,0001,978,0002,531,328
3Apr 13, 2026 08:433,16524,796,9805,935,0001,978,0002,531,328
4Apr 13, 2026 08:433,16626,772,3125,936,0001,978,0002,523,136
5Apr 13, 2026 08:433,16623,122,7374,947,0002,968,0002,396,160
6Apr 13, 2026 08:433,16822,940,8295,941,0001,980,0002,289,664
7Apr 13, 2026 08:433,16927,745,6224,952,0002,971,0002,289,664
8Apr 13, 2026 08:433,21629,903,9594,020,0004,020,0002,277,376
9Apr 13, 2026 08:433,26824,678,4215,106,0003,064,0002,523,136