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: 18,528Success
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:1718,27777,008,04841,632,0004,061,0002,523,136
2Jan 1, 2026 22:1718,52873,214,90543,300,0003,020,0002,510,848
3Jan 1, 2026 22:1718,82771,565,59743,063,0004,005,0002,310,144