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 listJul 5, 2026 21:59Victor MerckléVictor MerckléScore: 1,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 22:011,65112,047,9082,919,0001,210,0002,117,632stderr
2Jul 5, 2026 22:011,65412,130,5082,932,0001,205,0002,117,632stderr
3Jul 5, 2026 22:011,65915,298,5892,913,0001,235,0002,117,632stderr
4Jul 5, 2026 22:011,66412,099,3052,929,0001,232,0002,117,632stderr
5Jul 5, 2026 22:011,70212,306,5723,046,0001,210,0002,117,632stderr
6Jul 5, 2026 22:011,70512,318,6513,048,0001,216,0002,117,632stderr
7Jul 5, 2026 22:011,74112,341,1593,106,0001,248,0002,117,632stderr
8Jul 5, 2026 22:011,74612,365,0893,121,0001,244,0002,117,632stderr
9Jul 5, 2026 22:011,76021,368,5843,164,0001,236,0002,113,536stderr