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 5, 2026 22:35Elijah KinElijah KinScore: 2,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 22:362,38014,997,8544,835,0001,115,0002,117,632
2Jun 5, 2026 22:362,41415,033,2744,911,0001,125,0002,117,632
3Jun 5, 2026 22:362,42315,094,2734,931,0001,127,0002,117,632
4Jun 5, 2026 22:362,52915,337,7685,203,0001,120,0002,117,632
5Jun 5, 2026 22:362,55415,456,2705,271,0001,114,0002,117,632
6Jun 5, 2026 22:362,58315,454,1905,333,0001,125,0002,117,632
7Jun 5, 2026 22:362,61715,856,7685,410,0001,134,0002,117,632
8Jun 5, 2026 22:362,62515,760,0755,434,0001,130,0002,117,632
9Jun 5, 2026 22:362,63415,662,6395,451,0001,136,0002,117,632