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 listJan 16, 2026 03:31Josu San MartinJosu San MartinScore: 9,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 03:319,76646,661,11520,346,0004,069,0002,543,616
2Jan 16, 2026 03:319,76852,001,06619,334,0005,087,0002,478,080
3Jan 16, 2026 03:319,77554,783,21618,328,0006,109,0002,478,080