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 listMay 22, 2026 13:02M-RochatM-RochatScore: 4,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 13:024,46720,330,33710,090,0001,079,0002,117,632
2May 22, 2026 13:024,48420,399,42510,123,0001,087,0002,117,632
3May 22, 2026 13:024,49220,417,40910,142,0001,089,0002,117,632
4May 22, 2026 13:024,49620,587,87110,156,0001,086,0002,117,632
5May 22, 2026 13:024,49820,477,62410,158,0001,088,0002,117,632
6May 22, 2026 13:024,50022,892,54310,163,0001,088,0002,117,632
7May 22, 2026 13:024,50020,464,60110,162,0001,088,0002,117,632
8May 22, 2026 13:024,50923,308,99710,187,0001,087,0002,117,632
9May 22, 2026 13:024,57820,707,74610,336,0001,109,0002,117,632