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 9, 2026 01:29Elijah KinElijah KinScore: 2,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 01:302,20514,563,7024,260,0001,254,0002,117,632
2Jun 9, 2026 01:302,22014,653,8834,302,0001,248,0002,117,632
3Jun 9, 2026 01:302,23414,708,2584,337,0001,248,0002,117,632
4Jun 9, 2026 01:302,31114,838,9794,530,0001,249,0002,117,632
5Jun 9, 2026 01:302,32715,124,6974,570,0001,249,0002,117,632
6Jun 9, 2026 01:302,34214,917,0044,620,0001,236,0002,117,632
7Jun 9, 2026 01:302,35715,388,6774,643,0001,251,0002,117,632
8Jun 9, 2026 01:302,36114,942,0544,649,0001,255,0002,117,632
9Jun 9, 2026 01:302,36915,108,3704,673,0001,250,0002,117,632