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 listApr 26, 2026 05:25Charles CabergsCharles CabergsScore: 7,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:257,14741,266,95212,905,0004,963,0002,539,520
2Apr 26, 2026 05:257,17337,301,62210,960,0006,974,0002,539,520
3Apr 26, 2026 05:257,33038,897,47613,236,0005,091,0002,535,424
4Apr 26, 2026 05:257,34136,365,41713,256,0005,098,0002,334,720
5Apr 26, 2026 05:257,35036,978,85212,250,0006,125,0002,359,296
6Apr 26, 2026 05:257,39139,588,71513,345,0005,133,0002,539,520
7Apr 26, 2026 05:257,49236,774,18113,528,0005,203,0002,539,520
8Apr 26, 2026 05:257,70635,107,72813,183,0006,084,0002,392,064
9Apr 26, 2026 05:257,77033,620,26714,315,0005,112,0002,519,040