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 02:47Elijah KinElijah KinScore: 2,116Success
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 02:492,06314,277,3023,919,0001,240,0002,117,632
2Jun 8, 2026 02:492,07014,246,8023,934,0001,242,0002,117,632
3Jun 8, 2026 02:492,08914,215,3213,958,0001,265,0002,117,632
4Jun 8, 2026 02:492,09414,329,2653,970,0001,267,0002,117,632
5Jun 8, 2026 02:492,11614,401,4364,175,0001,117,0002,117,632
6Jun 8, 2026 02:492,20814,593,1254,275,0001,245,0002,117,632
7Jun 8, 2026 02:492,21314,575,6464,278,0001,255,0002,117,632
8Jun 8, 2026 02:492,33414,944,1074,568,0001,269,0002,117,632
9Jun 8, 2026 02:492,35014,958,6014,612,0001,264,0002,117,632