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:52Elijah KinElijah KinScore: 34,283Success
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:5234,11194,421,42683,239,0002,040,0002,113,536
2May 19, 2026 08:5234,13494,477,83783,296,0002,039,0002,113,536
3May 19, 2026 08:5234,13694,803,46283,303,0002,038,0002,113,536
4May 19, 2026 08:5234,14097,375,10183,311,0002,040,0002,113,536
5May 19, 2026 08:5234,28396,230,47183,667,0002,042,0002,113,536
6May 19, 2026 08:5234,30194,923,16083,714,0002,039,0002,113,536
7May 19, 2026 08:5234,32795,032,93783,778,0002,040,0002,113,536
8May 19, 2026 08:5234,38395,138,26083,920,0002,039,0002,113,536
9May 19, 2026 08:5234,40197,791,89483,966,0002,038,0002,113,536