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 4, 2026 21:43Elijah KinElijah KinScore: 2,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 21:452,76015,942,4115,795,0001,107,0002,117,632
2Jun 4, 2026 21:452,78016,104,7685,828,0001,123,0002,117,632
3Jun 4, 2026 21:452,78215,983,4275,827,0001,128,0002,117,632
4Jun 4, 2026 21:452,78616,040,9005,848,0001,117,0002,117,632
5Jun 4, 2026 21:452,79316,101,4685,845,0001,138,0002,117,632
6Jun 4, 2026 21:452,80716,112,5985,886,0001,132,0002,117,632
7Jun 4, 2026 21:452,94616,367,3996,236,0001,130,0002,117,632
8Jun 4, 2026 21:452,95816,370,7396,259,0001,138,0002,117,632
9Jun 4, 2026 21:452,98817,085,1306,318,0001,153,0002,117,632