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 listFeb 5, 2026 02:51Josu San MartinJosu San MartinScore: 8,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 02:518,38256,367,60715,967,0004,989,0002,277,376
2Feb 5, 2026 02:518,39648,834,31717,993,0002,998,0002,269,184
3Feb 5, 2026 02:518,40450,402,92118,010,0003,001,0002,506,752
4Feb 5, 2026 02:518,44645,772,52918,100,0003,016,0002,498,560
5Feb 5, 2026 02:518,45253,278,70616,099,0005,031,0002,498,560
6Feb 5, 2026 02:518,46947,968,56217,140,0004,033,0002,506,752
7Feb 5, 2026 02:518,50147,037,75618,216,0003,036,0002,273,280
8Feb 5, 2026 02:518,51654,643,45715,208,0006,083,0002,494,464
9Feb 5, 2026 02:518,54247,071,58517,287,0004,067,0002,269,184