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 listMay 19, 2026 08:53Elijah KinElijah KinScore: 34,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 08:5434,06997,080,63083,131,0002,043,0002,113,536
2May 19, 2026 08:5434,08494,351,77983,171,0002,040,0002,113,536
3May 19, 2026 08:5434,11997,186,36183,258,0002,041,0002,113,536
4May 19, 2026 08:5434,12194,493,52783,264,0002,039,0002,113,536
5May 19, 2026 08:5434,13797,509,53083,302,0002,041,0002,113,536
6May 19, 2026 08:5434,19294,713,59283,440,0002,042,0002,113,536
7May 19, 2026 08:5434,21494,740,28283,495,0002,042,0002,113,536
8May 19, 2026 08:5434,22395,450,28483,518,0002,040,0002,113,536
9May 19, 2026 08:5434,39395,141,88783,939,0002,045,0002,113,536