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 listAug 27, 2026 22:21Elijah KinElijah KinScore: 2,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 22:222,17815,202,8324,324,0001,122,0002,117,632
2Aug 27, 2026 22:222,21815,220,1034,267,0001,280,0002,117,632
3Aug 27, 2026 22:222,28015,504,1864,460,0001,242,0002,117,632
4Aug 27, 2026 22:222,29315,565,4434,491,0001,243,0002,117,632
5Aug 27, 2026 22:222,30015,499,1784,474,0001,278,0002,117,632
6Aug 27, 2026 22:222,33615,606,1364,572,0001,269,0002,117,632
7Aug 27, 2026 22:222,34916,408,7434,617,0001,257,0002,117,632
8Aug 27, 2026 22:222,37915,836,4574,620,0001,329,0002,117,632
9Aug 27, 2026 22:222,40615,823,7754,679,0001,338,0002,117,632