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 15, 2026 19:16Victor MerckléVictor MerckléScore: 1,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 19:191,71411,648,5633,082,0001,204,0002,113,536
2Jun 15, 2026 19:191,71611,677,4783,086,0001,204,0002,113,536
3Jun 15, 2026 19:191,72411,516,7293,101,0001,209,0002,113,536
4Jun 15, 2026 19:191,76711,792,5943,216,0001,203,0002,113,536
5Jun 15, 2026 19:191,81011,862,4433,320,0001,205,0002,113,536
6Jun 15, 2026 19:191,83511,966,4093,366,0001,222,0002,113,536
7Jun 15, 2026 19:191,83911,937,1873,402,0001,196,0002,113,536
8Jun 15, 2026 19:191,84911,937,6503,422,0001,201,0002,113,536
9Jun 15, 2026 19:191,90612,116,3563,392,0001,373,0002,113,536