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 03:23Elijah KinElijah KinScore: 2,222Success
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 03:232,04414,184,6673,878,0001,233,0002,117,632
2Jun 8, 2026 03:232,04614,257,8703,879,0001,237,0002,117,632
3Jun 8, 2026 03:232,04714,223,3353,884,0001,235,0002,117,632
4Jun 8, 2026 03:232,19314,553,1784,207,0001,277,0002,117,632
5Jun 8, 2026 03:232,22214,604,7544,297,0001,258,0002,117,632
6Jun 8, 2026 03:232,28215,012,7514,432,0001,275,0002,117,632
7Jun 8, 2026 03:232,30414,816,2714,503,0001,257,0002,117,632
8Jun 8, 2026 03:232,32514,845,4244,555,0001,258,0002,117,632
9Jun 8, 2026 03:232,37215,017,3704,663,0001,267,0002,117,632