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 21, 2026 19:21Charles CabergsCharles CabergsScore: 11,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 19:2111,58551,748,56921,972,0006,991,0002,338,816
2Apr 21, 2026 19:2111,63345,993,83623,067,0006,017,0002,338,816
3Apr 21, 2026 19:2111,69846,587,61124,205,0005,042,0002,342,912
4Apr 21, 2026 19:2111,76143,784,50922,307,0007,097,0002,338,816
5Apr 21, 2026 19:2111,88844,681,06522,548,0007,174,0002,379,776
6Apr 21, 2026 19:2111,91851,035,04223,838,0005,959,0002,342,912
7Apr 21, 2026 19:2111,97852,828,79522,959,0006,987,0002,338,816
8Apr 21, 2026 19:2112,05546,948,62822,102,0008,037,0002,338,816
9Apr 21, 2026 19:2112,07046,293,11222,130,0008,047,0002,330,624