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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 21:102,30414,726,0904,637,0001,123,0002,117,632
2Jun 6, 2026 21:102,30814,816,1374,644,0001,126,0002,117,632
3Jun 6, 2026 21:102,31414,900,0134,657,0001,128,0002,117,632
4Jun 6, 2026 21:102,44015,063,4204,973,0001,127,0002,117,632
5Jun 6, 2026 21:102,49415,302,1485,114,0001,121,0002,117,632
6Jun 6, 2026 21:102,51415,281,5355,169,0001,116,0002,117,632
7Jun 6, 2026 21:102,53315,381,0305,211,0001,122,0002,117,632
8Jun 6, 2026 21:102,58815,529,5585,344,0001,127,0002,117,632
9Jun 6, 2026 21:102,61315,715,6265,399,0001,134,0002,117,632