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 9, 2026 03:06Elijah KinElijah KinScore: 2,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 03:072,08214,336,2853,970,0001,235,0002,117,632
2Jun 9, 2026 03:072,09814,363,1984,008,0001,239,0002,117,632
3Jun 9, 2026 03:072,11014,401,9734,017,0001,259,0002,117,632
4Jun 9, 2026 03:072,24214,725,6384,213,0001,393,0002,117,632
5Jun 9, 2026 03:072,29314,895,9334,487,0001,246,0002,117,632
6Jun 9, 2026 03:072,34614,965,0514,608,0001,259,0002,117,632
7Jun 9, 2026 03:072,35415,015,1584,785,0001,100,0002,117,632
8Jun 9, 2026 03:072,35915,189,5184,653,0001,245,0002,117,632
9Jun 9, 2026 03:072,37715,103,2914,680,0001,264,0002,117,632