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:25Elijah KinElijah KinScore: 2,259Success
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:312,02614,383,5853,745,0001,321,0002,117,632
2Jun 27, 2026 18:312,03214,337,1243,765,0001,317,0002,117,632
3Jun 27, 2026 18:312,04414,344,8153,786,0001,325,0002,117,632
4Jun 27, 2026 18:312,23814,821,5794,288,0001,309,0002,117,632
5Jun 27, 2026 18:312,25914,915,9634,298,0001,351,0002,117,632
6Jun 27, 2026 18:312,29615,065,2734,393,0001,349,0002,117,632
7Jun 27, 2026 18:312,31315,074,6694,452,0001,332,0002,117,632
8Jun 27, 2026 18:312,35515,180,3674,590,0001,299,0002,117,632
9Jun 27, 2026 18:312,36415,150,7304,595,0001,317,0002,117,632