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 5, 2026 21:16Elijah KinElijah KinScore: 2,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 21:172,54415,419,0825,252,0001,109,0002,117,632
2Jun 5, 2026 21:172,55017,923,5255,265,0001,110,0002,117,632
3Jun 5, 2026 21:172,55215,369,0715,269,0001,113,0002,117,632
4Jun 5, 2026 21:172,55715,417,9805,285,0001,109,0002,117,632
5Jun 5, 2026 21:172,66215,705,4875,535,0001,120,0002,117,632
6Jun 5, 2026 21:172,68915,737,8315,618,0001,106,0002,117,632
7Jun 5, 2026 21:172,69415,801,2025,628,0001,108,0002,117,632
8Jun 5, 2026 21:172,73716,193,2655,722,0001,121,0002,117,632
9Jun 5, 2026 21:172,77216,428,9615,807,0001,125,0002,117,632