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 8, 2026 21:08Elijah KinElijah KinScore: 2,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 21:122,14514,532,5604,099,0001,264,0002,117,632
2Jun 8, 2026 21:122,14914,521,2984,101,0001,272,0002,117,632
3Jun 8, 2026 21:122,15114,530,1794,095,0001,284,0002,117,632
4Jun 8, 2026 21:122,15614,510,4334,128,0001,262,0002,117,632
5Jun 8, 2026 21:122,17414,521,9854,139,0001,297,0002,117,632
6Jun 8, 2026 21:122,17614,486,8984,158,0001,282,0002,117,632
7Jun 8, 2026 21:122,31214,839,3104,482,0001,298,0002,117,632
8Jun 8, 2026 21:122,35414,934,3374,590,0001,295,0002,117,632
9Jun 8, 2026 21:122,40915,101,7214,734,0001,289,0002,117,632