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 27, 2026 01:51Victor MerckléVictor MerckléScore: 3,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 01:543,19217,040,8214,874,0003,107,0002,138,112
2Jun 27, 2026 01:543,22917,181,6914,481,0003,593,0002,187,264
3Jun 27, 2026 01:543,24417,082,0615,261,0002,851,0002,134,016
4Jun 27, 2026 01:543,27717,243,6894,483,0003,710,0002,187,264
5Jun 27, 2026 01:543,28917,297,4354,522,0003,702,0002,187,264
6Jun 27, 2026 01:543,29617,243,4025,277,0002,965,0002,138,112
7Jun 27, 2026 01:543,35317,388,0705,490,0002,893,0002,138,112
8Jun 27, 2026 01:543,35417,466,5305,509,0002,877,0002,138,112
9Jun 27, 2026 01:543,35717,438,8075,433,0002,960,0002,138,112