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:36A_ShamanA_ShamanScore: 17,334Success
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:3617,17452,192,70138,531,0004,404,0002,113,536
2Jun 21, 2026 17:3617,23652,249,43639,781,0003,311,0002,113,536
3Jun 21, 2026 17:3617,25852,270,46439,770,0003,377,0002,113,536
4Jun 21, 2026 17:3617,30552,399,10239,119,0004,144,0002,113,536
5Jun 21, 2026 17:3617,33452,829,97939,996,0003,340,0002,113,536
6Jun 21, 2026 17:3617,39852,987,77440,144,0003,353,0002,113,536
7Jun 21, 2026 17:3617,51353,284,60840,338,0003,445,0002,113,536
8Jun 21, 2026 17:3617,97554,475,07940,643,0004,295,0002,113,536
9Jun 21, 2026 17:3617,99454,143,79140,590,0004,396,0002,113,536