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 23, 2026 18:52olliecrowolliecrowScore: 30,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 18:5430,12494,416,51571,295,0004,016,0002,396,160
2Apr 23, 2026 18:5430,12692,541,65573,309,0002,008,0002,387,968
3Apr 23, 2026 18:5430,18198,406,51474,447,0001,006,0002,396,160
4Apr 23, 2026 18:5430,19591,178,39973,476,0002,013,0002,478,080
5Apr 23, 2026 18:5430,21094,267,55574,518,0001,007,0002,387,968
6Apr 23, 2026 18:5430,41194,606,20675,016,0001,013,0002,392,064
7Apr 23, 2026 18:5430,48093,406,10374,196,0002,005,0002,392,064
8Apr 23, 2026 18:5430,52295,545,01473,294,0003,012,0002,392,064
9Apr 23, 2026 18:5430,54599,269,64774,355,0002,009,0002,387,968