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 listJun 8, 2026 21:24Elijah KinElijah KinScore: 2,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 21:292,21214,596,9774,264,0001,267,0002,117,632
2Jun 8, 2026 21:292,31814,937,8194,503,0001,293,0002,117,632
3Jun 8, 2026 21:292,34714,917,6614,581,0001,288,0002,117,632
4Jun 8, 2026 21:292,35615,029,9404,612,0001,278,0002,117,632
5Jun 8, 2026 21:292,37014,979,1994,651,0001,274,0002,117,632
6Jun 8, 2026 21:292,42915,142,3974,781,0001,293,0002,117,632
7Jun 8, 2026 21:292,47615,333,0134,899,0001,292,0002,117,632
8Jun 8, 2026 21:292,48715,235,8714,933,0001,285,0002,113,536
9Jun 8, 2026 21:292,53415,398,6155,048,0001,289,0002,117,632