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 23:13Elijah KinElijah KinScore: 2,268Success
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 23:142,04114,247,4353,874,0001,229,0002,117,632
2Jun 8, 2026 23:142,04614,278,1723,867,0001,249,0002,117,632
3Jun 8, 2026 23:142,07314,280,2743,876,0001,308,0002,117,632
4Jun 8, 2026 23:142,21014,631,2904,273,0001,252,0002,117,632
5Jun 8, 2026 23:142,26814,755,9504,403,0001,267,0002,117,632
6Jun 8, 2026 23:142,33417,733,8644,570,0001,267,0002,117,632
7Jun 8, 2026 23:142,33814,888,2714,586,0001,259,0002,117,632
8Jun 8, 2026 23:142,35115,059,9254,612,0001,266,0002,117,632
9Jun 8, 2026 23:142,37314,985,7524,675,0001,258,0002,117,632