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 02:11Elijah KinElijah KinScore: 2,297Success
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 02:122,02314,211,1833,819,0001,239,0002,117,632
2Jun 9, 2026 02:122,19414,544,7184,248,0001,238,0002,117,632
3Jun 9, 2026 02:122,27314,742,2564,447,0001,236,0002,117,632
4Jun 9, 2026 02:122,27514,791,7584,593,0001,095,0002,117,632
5Jun 9, 2026 02:122,29716,548,8194,486,0001,257,0002,117,632
6Jun 9, 2026 02:122,33214,966,7964,573,0001,257,0002,117,632
7Jun 9, 2026 02:122,33915,032,9094,605,0001,243,0002,117,632
8Jun 9, 2026 02:122,34215,321,1834,631,0001,226,0002,117,632
9Jun 9, 2026 02:122,35214,970,2834,612,0001,268,0002,117,632