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 3, 2026 23:10Elijah KinElijah KinScore: 2,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 23:132,78015,986,6845,748,0001,202,0002,117,632
2Jun 3, 2026 23:132,80016,015,7645,786,0001,215,0002,117,632
3Jun 3, 2026 23:132,81516,340,6955,830,0001,209,0002,117,632
4Jun 3, 2026 23:132,86316,705,7856,025,0001,134,0002,117,632
5Jun 3, 2026 23:132,88316,689,4856,057,0001,152,0002,117,632
6Jun 3, 2026 23:132,89016,297,0136,092,0001,135,0002,117,632
7Jun 3, 2026 23:132,90416,825,2316,109,0001,152,0002,117,632
8Jun 3, 2026 23:132,94416,794,3456,204,0001,156,0002,117,632
9Jun 3, 2026 23:132,97616,972,6526,300,0001,141,0002,117,632