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 8, 2026 21:20Elijah KinElijah KinScore: 2,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 21:232,18414,592,7724,201,0001,260,0002,117,632
2Jun 8, 2026 21:232,19014,564,2264,219,0001,258,0002,117,632
3Jun 8, 2026 21:232,38914,996,4214,686,0001,287,0002,117,632
4Jun 8, 2026 21:232,39215,095,2434,691,0001,290,0002,117,632
5Jun 8, 2026 21:232,40115,135,1114,732,0001,272,0002,117,632
6Jun 8, 2026 21:232,45115,332,4034,859,0001,269,0002,117,632
7Jun 8, 2026 21:232,48615,261,7464,958,0001,257,0002,117,632
8Jun 8, 2026 21:232,53515,407,2565,064,0001,274,0002,117,632
9Jun 8, 2026 21:232,53915,368,1165,072,0001,277,0002,117,632