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 06:01Elijah KinElijah KinScore: 10,786Success
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 06:0210,60435,815,51422,080,0004,432,0002,117,632
2Jun 3, 2026 06:0210,65135,829,50622,173,0004,456,0002,113,536
3Jun 3, 2026 06:0210,76836,092,18722,503,0004,417,0002,113,536
4Jun 3, 2026 06:0210,77836,235,34321,534,0005,411,0002,117,632
5Jun 3, 2026 06:0210,78636,607,10122,518,0004,448,0002,117,632
6Jun 3, 2026 06:0210,81636,322,67121,599,0005,443,0002,117,632
7Jun 3, 2026 06:0210,83236,372,23921,623,0005,459,0002,117,632
8Jun 3, 2026 06:0210,83336,309,13621,816,0005,268,0002,117,632
9Jun 3, 2026 06:0210,83936,694,25421,896,0005,202,0002,117,632