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 listMar 4, 2026 19:20olliecrowolliecrowScore: 14,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 19:2014,25461,353,50732,582,0003,054,0002,383,872
2Mar 4, 2026 19:2014,26664,502,04431,589,0004,076,0002,383,872
3Mar 4, 2026 19:2014,29468,803,42930,630,0005,105,0002,404,352
4Mar 4, 2026 19:2014,29462,085,89032,673,0003,063,0002,387,968
5Mar 4, 2026 19:2014,35464,810,61030,902,0004,984,0002,445,312
6Mar 4, 2026 19:2014,35862,976,18029,912,0005,982,0002,510,848
7Mar 4, 2026 19:2014,36763,537,14129,931,0005,986,0002,318,336
8Mar 4, 2026 19:2014,36863,487,87131,930,0003,991,0002,383,872
9Mar 4, 2026 19:2014,37760,732,92030,808,0005,134,0002,387,968