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 listMar 19, 2026 17:53Dominique GarmierDominique GarmierScore: 11,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 17:2911,44253,556,93822,475,0006,129,0002,260,992
2Mar 19, 2026 17:2911,51553,399,89623,825,0004,963,0002,404,352
3Mar 19, 2026 17:5311,54157,923,66722,884,0005,969,0002,277,376
4Mar 19, 2026 17:2911,55657,393,73822,912,0005,977,0002,277,376
5Mar 19, 2026 17:5311,63457,102,75922,065,0007,020,0002,416,640
6Mar 19, 2026 17:5311,73050,761,38925,280,0004,044,0002,330,624