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:30Elijah KinElijah KinScore: 2,620Success
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:342,56015,426,3145,284,0001,118,0002,117,632
2Jun 4, 2026 03:342,56215,455,2985,276,0001,129,0002,117,632
3Jun 4, 2026 03:342,60715,533,9715,384,0001,135,0002,117,632
4Jun 4, 2026 03:342,61015,553,1545,381,0001,145,0002,117,632
5Jun 4, 2026 03:342,62015,613,8875,396,0001,154,0002,117,632
6Jun 4, 2026 03:342,63215,597,3685,416,0001,165,0002,117,632
7Jun 4, 2026 03:342,63415,865,6095,402,0001,184,0002,117,632
8Jun 4, 2026 03:342,69015,729,6875,570,0001,156,0002,117,632
9Jun 4, 2026 03:342,70216,147,9805,565,0001,191,0002,117,632