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 listJun 10, 2026 09:13Victor MerckléVictor MerckléScore: 3,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 09:143,73818,944,2977,077,0002,268,0002,138,112
2Jun 10, 2026 09:143,90919,109,0267,361,0002,413,0002,138,112
3Jun 10, 2026 09:143,94919,167,2867,633,0002,240,0002,142,208
4Jun 10, 2026 09:143,95217,920,5777,428,0002,453,0002,142,208
5Jun 10, 2026 09:143,95819,490,6307,657,0002,239,0002,138,112
6Jun 10, 2026 09:143,96619,706,5707,535,0002,382,0002,142,208
7Jun 10, 2026 09:143,97218,785,7367,635,0002,297,0002,142,208
8Jun 10, 2026 09:143,97419,366,5287,507,0002,428,0002,138,112
9Jun 10, 2026 09:143,98419,493,1277,556,0002,404,0002,138,112