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 listJan 16, 2026 02:36Josu San MartinJosu San MartinScore: 10,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 02:369,98653,850,19719,972,0004,993,0002,301,952
2Jan 16, 2026 02:3610,01458,915,50821,029,0004,005,0002,506,752
3Jan 16, 2026 02:3610,02642,906,72619,050,0006,016,0002,310,144
4Jan 16, 2026 02:3610,07452,631,63819,141,0006,044,0002,334,720
5Jan 16, 2026 02:3610,08050,511,24219,152,0006,048,0002,306,048
6Jan 16, 2026 02:3610,10649,788,72822,233,0003,031,0002,301,952
7Jan 16, 2026 02:3610,10853,308,43818,194,0007,075,0002,293,760
8Jan 16, 2026 02:3610,11054,431,26621,232,0004,044,0002,310,144
9Jan 16, 2026 02:3610,11258,086,77819,214,0006,067,0002,482,176