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 13, 2026 22:33Victor MerckléVictor MerckléScore: 6,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 22:335,68323,447,19311,027,0003,182,0002,117,632
2Jun 13, 2026 22:335,98524,082,35111,772,0003,192,0002,117,632
3Jun 13, 2026 22:336,10626,298,59812,112,0003,153,0002,121,728
4Jun 13, 2026 22:336,12024,490,50512,119,0003,182,0002,117,632
5Jun 13, 2026 22:336,12024,476,29212,155,0003,145,0002,117,632
6Jun 13, 2026 22:336,13924,575,04612,181,0003,167,0002,117,632
7Jun 13, 2026 22:336,15124,564,03612,223,0003,156,0002,117,632
8Jun 13, 2026 22:336,16324,597,08012,239,0003,169,0002,117,632
9Jun 13, 2026 22:336,25024,732,17712,344,0003,282,0002,117,632