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 7, 2026 00:27Elijah KinElijah KinScore: 2,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 00:302,21814,537,6354,433,0001,113,0002,117,632
2Jun 7, 2026 00:302,34915,005,9194,765,0001,109,0002,117,632
3Jun 7, 2026 00:302,38014,907,9244,840,0001,111,0002,117,632
4Jun 7, 2026 00:302,38914,997,5494,875,0001,099,0002,117,632
5Jun 7, 2026 00:302,39115,074,8604,867,0001,112,0002,117,632
6Jun 7, 2026 00:302,40015,022,9004,900,0001,100,0002,117,632
7Jun 7, 2026 00:302,42315,085,2744,949,0001,110,0002,117,632
8Jun 7, 2026 00:302,42815,077,5734,962,0001,110,0002,117,632
9Jun 7, 2026 00:302,50115,750,8245,149,0001,105,0002,117,632