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 7, 2026 16:07Elijah KinElijah KinScore: 2,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 16:092,21714,588,1284,418,0001,125,0002,117,632
2Jun 7, 2026 16:092,33415,107,1264,555,0001,281,0002,117,632
3Jun 7, 2026 16:092,37714,969,2434,653,0001,290,0002,117,632
4Jun 7, 2026 16:092,38214,989,9844,674,0001,281,0002,117,632
5Jun 7, 2026 16:092,40615,115,1594,723,0001,292,0002,117,632
6Jun 7, 2026 16:092,42715,083,0164,781,0001,287,0002,117,632
7Jun 7, 2026 16:092,44415,161,3074,835,0001,276,0002,117,632
8Jun 7, 2026 16:092,47815,297,5504,910,0001,285,0002,117,632
9Jun 7, 2026 16:092,50415,285,9745,118,0001,144,0002,117,632