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 18:10Victor MerckléVictor MerckléScore: 3,134Success
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 18:113,06417,173,4855,222,0002,438,0002,142,208
2Jun 10, 2026 18:113,07317,590,6895,132,0002,552,0002,138,112
3Jun 10, 2026 18:113,07516,784,6835,172,0002,517,0002,142,208
4Jun 10, 2026 18:113,09616,600,6865,321,0002,419,0002,138,112
5Jun 10, 2026 18:113,13417,066,4795,206,0002,631,0002,138,112
6Jun 10, 2026 18:113,19616,982,1675,358,0002,632,0002,138,112
7Jun 10, 2026 18:113,25515,966,9375,477,0002,662,0002,142,208
8Jun 10, 2026 18:113,28015,724,3115,538,0002,663,0002,142,208
9Jun 10, 2026 18:113,32217,612,5925,981,0002,325,0002,138,112