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 listMay 17, 2026 05:59Jacob McDanielJacob McDanielScore: 8,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:018,41131,712,25116,806,0004,223,0002,113,536
2May 17, 2026 06:018,43429,956,85116,931,0004,156,0002,113,536
3May 17, 2026 06:018,46730,774,53316,920,0004,249,0002,113,536
4May 17, 2026 06:018,47135,119,72316,886,0004,293,0002,113,536
5May 17, 2026 06:018,51730,192,80117,040,0004,253,0002,113,536
6May 17, 2026 06:018,52830,117,65817,043,0004,277,0002,113,536
7May 17, 2026 06:018,63230,434,82517,397,0004,185,0002,113,536
8May 17, 2026 06:018,73933,502,92017,584,0004,264,0002,113,536
9May 17, 2026 06:019,27533,955,83618,778,0004,410,0002,113,536