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 21, 2026 17:17A_ShamanA_ShamanError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:18068,418,15752,022,0006,670,0002,113,536pos 0: expected 71 got 70
2Jun 21, 2026 17:18068,086,95451,814,0006,675,0002,113,536pos 0: expected 30 got 29
3Jun 21, 2026 17:18066,708,13250,298,0006,689,0002,113,536pos 0: expected 48 got 47