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:40Victor MerckléVictor MerckléScore: 5,440Success
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:415,39222,602,54210,325,0003,155,0002,117,632
2Jun 14, 2026 03:415,39622,636,24510,350,0003,141,0002,117,632
3Jun 14, 2026 03:415,43222,865,06410,467,0003,115,0002,117,632
4Jun 14, 2026 03:415,43722,718,00610,481,0003,113,0002,117,632
5Jun 14, 2026 03:415,44022,787,96310,485,0003,115,0002,117,632
6Jun 14, 2026 03:415,60423,138,58010,825,0003,187,0002,117,632
7Jun 14, 2026 03:415,65323,242,48610,979,0003,154,0002,117,632
8Jun 14, 2026 03:415,90123,880,07611,611,0003,143,0002,117,632
9Jun 14, 2026 03:416,02924,328,27911,881,0003,193,0002,117,632