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 4, 2026 03:16Elijah KinElijah KinScore: 2,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 03:192,56315,454,8285,316,0001,092,0002,117,632
2Jun 4, 2026 03:192,58415,499,2025,352,0001,108,0002,117,632
3Jun 4, 2026 03:192,58717,186,2325,345,0001,123,0002,117,632
4Jun 4, 2026 03:192,79416,458,6095,844,0001,142,0002,117,632
5Jun 4, 2026 03:192,80116,525,1085,850,0001,154,0002,117,632
6Jun 4, 2026 03:192,81216,286,2355,892,0001,139,0002,117,632
7Jun 4, 2026 03:192,81816,064,9565,905,0001,142,0002,117,632
8Jun 4, 2026 03:192,85616,589,2805,961,0001,179,0002,117,632
9Jun 4, 2026 03:192,88216,665,5356,007,0001,198,0002,117,632