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 26, 2026 23:52Victor MerckléVictor MerckléScore: 3,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 23:533,74019,040,3307,093,0002,259,0002,138,112
2Jun 26, 2026 23:533,76719,463,5257,087,0002,331,0002,142,208
3Jun 26, 2026 23:533,77219,151,0627,175,0002,255,0002,138,112
4Jun 26, 2026 23:533,77619,290,0757,084,0002,358,0002,142,208
5Jun 26, 2026 23:533,78819,266,5657,175,0002,297,0002,142,208
6Jun 26, 2026 23:533,90619,129,4937,445,0002,322,0002,142,208
7Jun 26, 2026 23:533,96919,608,8017,514,0002,410,0002,138,112
8Jun 26, 2026 23:533,97720,199,0037,410,0002,534,0002,138,112
9Jun 26, 2026 23:534,00118,388,5317,708,0002,296,0002,138,112