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:52Elijah KinElijah KinScore: 2,086Success
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:532,01414,332,0733,815,0001,221,0002,117,632
2Jun 27, 2026 18:532,02014,329,6743,830,0001,222,0002,117,632
3Jun 27, 2026 18:532,02214,363,2043,830,0001,226,0002,117,632
4Jun 27, 2026 18:532,04214,452,3743,856,0001,249,0002,117,632
5Jun 27, 2026 18:532,08614,584,7974,093,0001,122,0002,117,632
6Jun 27, 2026 18:532,13114,669,2824,080,0001,249,0002,117,632
7Jun 27, 2026 18:532,29214,936,5394,493,0001,237,0002,117,632
8Jun 27, 2026 18:532,31415,033,5914,531,0001,255,0002,117,632
9Jun 27, 2026 18:532,31715,016,7574,550,0001,244,0002,117,632