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:18Josu San MartinJosu San MartinScore: 9,569Success
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:189,53149,378,24917,871,0005,957,0002,379,776
2Jan 16, 2026 03:209,55048,055,06017,906,0005,968,0002,387,968
3Jan 16, 2026 03:189,55946,061,30318,919,0004,978,0002,396,160
4Jan 16, 2026 03:189,56050,370,88917,926,0005,975,0002,387,968
5Jan 16, 2026 03:209,56646,875,74316,941,0006,975,0002,441,216
6Jan 16, 2026 03:189,56852,914,27718,938,0004,983,0002,293,760
7Jan 16, 2026 03:189,56946,189,74619,936,0003,987,0002,383,872
8Jan 16, 2026 03:189,57255,319,60517,947,0005,982,0002,383,872
9Jan 16, 2026 03:189,58849,215,99616,979,0006,991,0002,379,776
10Jan 16, 2026 03:189,58945,916,86617,979,0005,993,0002,310,144
11Jan 16, 2026 03:189,60049,278,50916,000,0008,000,0002,383,872
12Jan 16, 2026 03:209,60051,555,44921,001,0003,000,0002,379,776