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 27, 2026 18:57Elijah KinElijah KinScore: 2,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 18:582,01315,541,3293,804,0001,229,0002,117,632
2Jun 27, 2026 18:582,01814,397,3283,817,0001,229,0002,117,632
3Jun 27, 2026 18:582,16814,731,6954,266,0001,156,0002,117,632
4Jun 27, 2026 18:582,23814,900,2644,331,0001,264,0002,117,632
5Jun 27, 2026 18:582,23814,912,3114,354,0001,242,0002,117,632
6Jun 27, 2026 18:582,29515,120,4154,479,0001,260,0002,117,632
7Jun 27, 2026 18:582,31115,421,4844,505,0001,273,0002,117,632
8Jun 27, 2026 18:582,34115,188,9244,524,0001,330,0002,117,632
9Jun 27, 2026 18:582,36615,233,8064,587,0001,329,0002,117,632