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 listApr 18, 2026 14:23Charles CabergsCharles CabergsScore: 16,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 14:2316,77970,382,41534,956,0006,991,0002,531,328
2Apr 18, 2026 14:2316,83266,292,33734,065,0008,015,0002,277,376
3Apr 18, 2026 14:2316,98072,368,92232,344,00010,107,0002,371,584