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 listFeb 5, 2026 04:46Josu San MartinJosu San MartinScore: 5,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:465,42525,538,0659,389,0004,173,0002,482,176
2Feb 5, 2026 04:465,43328,390,62510,449,0003,134,0002,527,232
3Feb 5, 2026 04:465,49227,526,63911,618,0002,112,0002,527,232