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 1, 2026 22:17Josu San MartinJosu San MartinScore: 14,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 22:1714,59561,791,54931,421,0005,067,0002,502,656
2Jan 1, 2026 22:1714,64861,873,37131,534,0005,086,0002,289,664
3Jan 1, 2026 22:1714,72570,274,41931,838,0004,974,0002,502,656