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 27, 2026 04:22Victor MerckléVictor MerckléScore: 2,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 04:232,54115,592,0213,798,0002,556,0002,142,208
2Jun 27, 2026 04:232,55916,081,4403,826,0002,572,0002,142,208
3Jun 27, 2026 04:232,64416,187,5734,176,0002,436,0002,142,208
4Jun 27, 2026 04:232,65416,091,4724,216,0002,419,0002,142,208
5Jun 27, 2026 04:232,65916,162,4424,204,0002,445,0002,142,208
6Jun 27, 2026 04:232,67415,565,8164,255,0002,431,0002,142,208
7Jun 27, 2026 04:232,67616,138,6594,219,0002,473,0002,142,208
8Jun 27, 2026 04:232,68816,551,2744,243,0002,478,0002,142,208
9Jun 27, 2026 04:232,68816,217,0144,250,0002,472,0002,142,208