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:20Josu San MartinJosu San MartinScore: 9,684Success
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:209,61848,829,63620,037,0004,007,0002,482,176
2Jan 16, 2026 03:209,63850,665,17520,079,0004,015,0002,404,352
3Jan 16, 2026 03:209,65446,922,24820,114,0004,022,0002,449,408
4Jan 16, 2026 03:209,68443,787,42920,176,0004,035,0002,490,368
5Jan 16, 2026 03:209,71245,035,46420,234,0004,046,0002,265,088
6Jan 16, 2026 03:209,71350,581,54521,247,0003,035,0002,478,080