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 3, 2026 07:30Elijah KinElijah KinScore: 5,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 07:315,14823,558,82410,642,0002,228,0002,113,536
2Jun 3, 2026 07:315,20522,101,7809,823,0003,191,0002,113,536
3Jun 3, 2026 07:315,22222,107,1829,918,0003,139,0002,113,536
4Jun 3, 2026 07:315,34622,381,31311,164,0002,203,0002,113,536
5Jun 3, 2026 07:315,42223,681,63311,342,0002,214,0002,113,536
6Jun 3, 2026 07:315,49122,717,41911,525,0002,204,0002,113,536
7Jun 3, 2026 07:315,56222,911,49511,701,0002,204,0002,113,536
8Jun 3, 2026 07:315,65024,951,19610,987,0003,139,0002,113,536
9Jun 3, 2026 07:315,66724,937,93510,995,0003,174,0002,113,536