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 1, 2026 12:08Victor MerckléVictor MerckléScore: 2,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 12:092,50713,809,1204,947,0001,322,0002,113,536
2Jun 1, 2026 12:092,58614,026,6565,099,0001,366,0002,113,536
3Jun 1, 2026 12:092,59813,968,6475,175,0001,320,0002,113,536
4Jun 1, 2026 12:092,60614,041,9765,192,0001,325,0002,113,536
5Jun 1, 2026 12:092,61014,067,6925,204,0001,321,0002,113,536
6Jun 1, 2026 12:092,61014,132,8985,202,0001,324,0002,113,536
7Jun 1, 2026 12:092,62014,133,1035,228,0001,324,0002,113,536
8Jun 1, 2026 12:092,62514,057,1135,229,0001,334,0002,113,536
9Jun 1, 2026 12:092,63414,112,4555,249,0001,338,0002,113,536