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 listMar 19, 2026 20:50Dominique GarmierDominique GarmierScore: 8,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 20:508,75547,783,68116,913,0004,974,0002,301,952
2Mar 19, 2026 20:508,75649,402,81018,906,0002,985,0002,506,752
3Mar 19, 2026 20:508,75850,092,42517,915,0003,981,0002,314,240
4Mar 19, 2026 20:508,76150,296,19818,916,0002,986,0002,326,528
5Mar 19, 2026 20:508,78646,492,94217,972,0003,993,0002,273,280
6Mar 19, 2026 20:508,78745,305,34817,974,0003,994,0002,473,984
7Mar 19, 2026 20:508,89746,178,96218,198,0004,044,0002,519,040
8Mar 19, 2026 20:508,92950,144,73618,265,0004,058,0002,273,280
9Mar 19, 2026 20:508,94046,231,52519,303,0003,047,0002,277,376