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 20:51Elijah KinElijah KinScore: 2,653Success
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 20:532,56015,366,3725,294,0001,106,0002,117,632
2Jun 5, 2026 20:532,57315,439,9815,321,0001,113,0002,117,632
3Jun 5, 2026 20:532,57415,448,3715,329,0001,106,0002,117,632
4Jun 5, 2026 20:532,64915,640,6855,517,0001,107,0002,117,632
5Jun 5, 2026 20:532,65315,649,7575,528,0001,105,0002,117,632
6Jun 5, 2026 20:532,68215,657,0625,591,0001,114,0002,117,632
7Jun 5, 2026 20:532,68915,752,7215,614,0001,109,0002,117,632
8Jun 5, 2026 20:532,73015,883,9775,720,0001,105,0002,117,632
9Jun 5, 2026 20:532,81116,351,0265,917,0001,111,0002,117,632