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 listApr 26, 2026 05:01olliecrowolliecrowScore: 4,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:044,58030,060,7528,329,0003,123,0002,347,008
2Apr 26, 2026 05:044,61430,312,8758,389,0003,146,0002,543,616
3Apr 26, 2026 05:044,64828,796,2059,508,0002,112,0002,371,584
4Apr 26, 2026 05:044,65027,081,3068,720,0002,906,0002,342,912
5Apr 26, 2026 05:044,66325,412,6769,539,0002,119,0002,506,752
6Apr 26, 2026 05:044,75830,847,8967,930,0003,965,0002,527,232
7Apr 26, 2026 05:044,80229,268,6639,004,0003,001,0002,539,520
8Apr 26, 2026 05:045,01631,188,7719,405,0003,135,0002,543,616
9Apr 26, 2026 05:045,08334,564,3579,531,0003,177,0002,539,520