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:06A_ShamanA_ShamanScore: 105,054Success
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:06104,867271,413,856259,067,0003,101,0002,117,632
2Jun 20, 2026 17:06104,988271,727,934259,360,0003,110,0002,117,632
3Jun 20, 2026 17:06105,005271,773,820259,480,0003,034,0002,113,536
4Jun 20, 2026 17:06105,014271,817,623259,388,0003,147,0002,117,632
5Jun 20, 2026 17:06105,054271,885,878259,601,0003,035,0002,117,632
6Jun 20, 2026 17:06105,219272,889,352260,014,0003,034,0002,117,632
7Jun 20, 2026 17:06105,240272,279,097260,093,0003,008,0002,117,632
8Jun 20, 2026 17:06105,601273,654,920260,954,0003,049,0002,113,536
9Jun 20, 2026 17:06105,950274,185,681261,829,0003,048,0002,117,632