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 listAug 31, 2026 00:01Victor MerckléVictor MerckléScore: 1,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 00:091,44111,806,5262,527,0001,076,0002,117,632stderr
2Aug 31, 2026 00:091,44311,929,7312,542,0001,066,0002,117,632stderr
3Aug 31, 2026 00:091,45011,855,8632,548,0001,079,0002,117,632stderr
4Aug 31, 2026 00:091,45611,837,0642,549,0001,091,0002,117,632stderr
5Aug 31, 2026 00:091,45811,820,6072,563,0001,084,0002,117,632stderr
6Aug 31, 2026 00:091,46112,015,3722,563,0001,091,0002,117,632stderr
7Aug 31, 2026 00:091,47411,928,1862,576,0001,109,0002,117,632stderr
8Aug 31, 2026 00:091,52012,173,2762,683,0001,119,0002,117,632stderr
9Aug 31, 2026 00:091,52612,001,9892,689,0001,126,0002,117,632stderr