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 listJul 7, 2026 18:28Victor MerckléVictor MerckléScore: 3,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 18:342,92416,618,5504,320,0002,991,0002,195,456stderr
2Jul 7, 2026 18:342,93016,677,4994,335,0002,992,0002,195,456stderr
3Jul 7, 2026 18:343,07617,074,7925,321,0002,369,0002,142,208stderr
4Jul 7, 2026 18:343,12917,169,9365,511,0002,312,0002,142,208stderr
5Jul 7, 2026 18:343,14417,366,7534,934,0002,927,0002,195,456stderr
6Jul 7, 2026 18:343,16417,212,1835,363,0002,549,0002,138,112stderr
7Jul 7, 2026 18:343,18017,323,9485,709,0002,243,0002,142,208stderr
8Jul 7, 2026 18:343,18217,381,9385,014,0002,943,0002,195,456stderr
9Jul 7, 2026 18:343,21317,431,4275,706,0002,328,0002,142,208stderr