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:00Elijah KinElijah KinScore: 2,633Success
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:012,34015,767,8804,721,0001,131,0002,121,728
2Aug 27, 2026 22:012,34315,796,7524,730,0001,128,0002,121,728
3Aug 27, 2026 22:012,36315,875,4704,763,0001,145,0002,121,728
4Aug 27, 2026 22:012,50516,267,5265,103,0001,160,0002,121,728
5Aug 27, 2026 22:012,63317,257,1915,440,0001,144,0002,117,632
6Aug 27, 2026 22:012,64316,737,7005,488,0001,121,0002,121,728
7Aug 27, 2026 22:012,65317,385,3155,505,0001,129,0002,121,728
8Aug 27, 2026 22:012,68317,473,6595,568,0001,140,0002,121,728
9Aug 27, 2026 22:012,70017,666,5935,606,0001,144,0002,121,728