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 20, 2026 17:13A_ShamanA_ShamanScore: 112,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 17:13111,752289,061,571268,564,00010,818,0002,117,632
2Jun 20, 2026 17:13111,954289,219,098268,747,00011,139,0002,117,632
3Jun 20, 2026 17:13112,151289,687,571269,138,00011,240,0002,117,632
4Jun 20, 2026 17:13112,361290,194,621269,317,00011,587,0002,117,632
5Jun 20, 2026 17:13112,544290,701,273270,378,00010,984,0002,117,632
6Jun 20, 2026 17:13112,947291,904,371270,934,00011,435,0002,117,632
7Jun 20, 2026 17:13113,095292,048,623271,348,00011,390,0002,117,632
8Jun 20, 2026 17:13113,228292,824,786272,059,00011,012,0002,117,632
9Jun 20, 2026 17:13113,987294,297,200274,131,00010,838,0002,117,632