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 14, 2026 03:45Victor MerckléVictor MerckléScore: 5,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2026 03:465,38822,599,97710,357,0003,113,0002,117,632
2Jun 14, 2026 03:465,39722,696,43910,368,0003,126,0002,117,632
3Jun 14, 2026 03:465,40822,693,97210,407,0003,113,0002,117,632
4Jun 14, 2026 03:465,44122,796,31010,445,0003,158,0002,117,632
5Jun 14, 2026 03:465,44822,898,77210,481,0003,139,0002,117,632
6Jun 14, 2026 03:465,61023,256,51710,868,0003,157,0002,117,632
7Jun 14, 2026 03:465,83123,722,60011,473,0003,105,0002,117,632
8Jun 14, 2026 03:465,89023,957,41211,536,0003,189,0002,117,632
9Jun 14, 2026 03:466,07825,563,45412,078,0003,118,0002,117,632