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 7, 2026 01:23Elijah KinElijah KinScore: 2,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 01:272,37215,022,7914,828,0001,104,0002,117,632
2Jun 7, 2026 01:272,53215,413,9795,226,0001,105,0002,117,632
3Jun 7, 2026 01:272,53715,412,5245,241,0001,103,0002,117,632
4Jun 7, 2026 01:272,56115,425,3725,219,0001,185,0002,117,632
5Jun 7, 2026 01:272,56415,516,3045,301,0001,110,0002,117,632
6Jun 7, 2026 01:272,59115,600,0865,380,0001,099,0002,117,632
7Jun 7, 2026 01:272,62316,033,4635,459,0001,099,0002,117,632
8Jun 7, 2026 01:272,64818,629,6625,520,0001,101,0002,117,632
9Jun 7, 2026 01:272,65215,654,1155,463,0001,167,0002,117,632