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 5, 2026 00:36Victor MerckléVictor MerckléScore: 2,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 00:372,33416,297,9263,540,0002,295,0002,146,304stderr
2Aug 5, 2026 00:372,39516,710,1003,286,0002,703,0002,146,304stderr
3Aug 5, 2026 00:372,42416,526,6123,602,0002,460,0002,146,304stderr
4Aug 5, 2026 00:372,42615,523,9313,618,0002,449,0002,142,208stderr
5Aug 5, 2026 00:372,42816,323,0413,604,0002,468,0002,146,304stderr
6Aug 5, 2026 00:372,45416,840,4903,636,0002,499,0002,146,304stderr
7Aug 5, 2026 00:372,46116,197,3433,617,0002,537,0002,146,304stderr
8Aug 5, 2026 00:372,48315,943,6613,632,0002,577,0002,146,304stderr
9Aug 5, 2026 00:372,48618,347,3793,689,0002,526,0002,146,304stderr