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 15:04limanjun99limanjun99Score: 3,048Success
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 15:043,03124,523,2286,495,0001,082,0002,293,760
2Apr 13, 2026 15:043,03224,558,2526,497,0001,082,0002,293,760
3Apr 13, 2026 15:043,03423,790,8505,419,0002,167,0002,514,944
4Apr 13, 2026 15:043,04224,341,3025,432,0002,172,0002,371,584
5Apr 13, 2026 15:043,04824,603,6335,443,0002,177,0002,273,280
6Apr 13, 2026 15:043,05424,494,5706,545,0001,090,0002,387,968
7Apr 13, 2026 15:043,07330,655,6415,488,0002,195,0002,285,568
8Apr 13, 2026 15:043,17124,852,6184,955,0002,973,0002,523,136
9Apr 13, 2026 15:043,18927,388,9535,980,0001,993,0002,269,184