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 29, 2026 09:16Elijah KinElijah KinScore: 5,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 09:174,83423,469,3019,840,0002,247,0002,117,632
2May 29, 2026 09:174,85121,782,1859,029,0003,099,0002,113,536
3May 29, 2026 09:174,87622,318,7769,057,0003,134,0002,117,632
4May 29, 2026 09:174,97224,142,9929,328,0003,103,0002,113,536
5May 29, 2026 09:175,00523,699,77210,274,0002,240,0002,113,536
6May 29, 2026 09:175,38923,363,38910,202,0003,271,0002,113,536
7May 29, 2026 09:175,42224,431,07910,281,0003,274,0002,113,536
8May 29, 2026 09:175,51124,827,18410,602,0003,176,0002,113,536
9May 29, 2026 09:175,53424,701,64510,638,0003,198,0002,113,536