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 20:57Victor MerckléVictor MerckléScore: 13,680Success
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 20:5813,13842,391,72828,805,0004,041,0002,117,632
2Jun 13, 2026 20:5813,14242,033,24728,736,0004,120,0002,117,632
3Jun 13, 2026 20:5813,18242,115,81028,912,0004,045,0002,117,632
4Jun 13, 2026 20:5813,29042,405,94629,182,0004,044,0002,117,632
5Jun 13, 2026 20:5813,68043,488,67330,156,0004,045,0002,117,632
6Jun 13, 2026 20:5813,71643,426,18431,185,0003,106,0002,117,632
7Jun 13, 2026 20:5813,71643,457,67730,218,0004,072,0002,117,632
8Jun 13, 2026 20:5813,78444,811,43930,417,0004,044,0002,117,632
9Jun 13, 2026 20:5813,86644,032,50530,624,0004,042,0002,117,632