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 listJun 21, 2026 17:26A_ShamanA_ShamanScore: 23,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:2623,52768,033,65952,382,0006,437,0002,113,536
2Jun 21, 2026 17:2623,74468,496,40953,108,0006,254,0002,113,536
3Jun 21, 2026 17:2623,76468,623,64853,062,0006,349,0002,113,536
4Jun 21, 2026 17:2623,93369,033,81053,401,0006,433,0002,113,536
5Jun 21, 2026 17:2623,93469,413,29453,469,0006,367,0002,113,536
6Jun 21, 2026 17:2624,06769,354,73253,834,0006,335,0002,113,536
7Jun 21, 2026 17:2624,14069,465,87854,077,0006,274,0002,113,536
8Jun 21, 2026 17:2624,16269,968,82454,224,0006,181,0002,113,536
9Jun 21, 2026 17:2624,35470,394,77954,519,0006,368,0002,113,536