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 28, 2026 08:17TudyMTudyMScore: 123,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:17123,634329,462,127304,084,0005,001,0002,342,912
2Apr 28, 2026 08:17123,683324,443,698303,205,0006,004,0002,355,200
3Apr 28, 2026 08:17123,709325,009,226305,270,0004,003,0002,551,808
4Apr 28, 2026 08:17123,710327,374,287304,271,0005,004,0002,355,200
5Apr 28, 2026 08:17123,715328,830,314308,288,0001,000,0002,347,008
6Apr 28, 2026 08:17123,725327,972,120305,310,0004,004,0002,359,296
7Apr 28, 2026 08:17123,749329,835,965307,378,0001,995,0002,519,040
8Apr 28, 2026 08:17123,750327,868,205306,372,0003,003,0002,359,296
9Apr 28, 2026 08:17123,754328,314,102303,379,0006,007,0002,347,008