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 02:53Josu San MartinJosu San MartinScore: 11,867Success
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 02:5311,83149,049,96923,459,0006,119,0002,379,776
2Jan 16, 2026 02:5311,86754,912,13422,506,0007,161,0002,510,848
3Jan 16, 2026 02:5311,87458,564,71423,544,0006,141,0002,473,984