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 6, 2026 16:13Elijah KinElijah KinScore: 2,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 16:142,29414,753,8964,615,0001,122,0002,117,632
2Jun 6, 2026 16:142,30014,706,5134,630,0001,121,0002,117,632
3Jun 6, 2026 16:142,36515,018,2444,707,0001,206,0002,117,632
4Jun 6, 2026 16:142,42015,093,3324,927,0001,123,0002,117,632
5Jun 6, 2026 16:142,45015,173,0095,010,0001,117,0002,117,632
6Jun 6, 2026 16:142,54515,785,2265,242,0001,122,0002,117,632
7Jun 6, 2026 16:142,59415,539,7205,366,0001,121,0002,117,632
8Jun 6, 2026 16:142,59815,641,7455,385,0001,111,0002,117,632
9Jun 6, 2026 16:142,62415,685,1635,433,0001,129,0002,117,632