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 3, 2026 16:22Elijah KinElijah KinScore: 3,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 16:253,32819,324,9867,171,0001,150,0002,117,632
2Jun 3, 2026 16:253,33817,311,0727,174,0001,171,0002,117,632
3Jun 3, 2026 16:253,35219,145,3647,216,0001,164,0002,117,632
4Jun 3, 2026 16:253,36417,455,5457,253,0001,159,0002,117,632
5Jun 3, 2026 16:253,37817,442,2897,275,0001,170,0002,117,632
6Jun 3, 2026 16:253,44917,619,5137,450,0001,174,0002,117,632
7Jun 3, 2026 16:253,53318,244,2537,712,0001,121,0002,117,632
8Jun 3, 2026 16:253,54020,243,9557,719,0001,131,0002,117,632
9Jun 3, 2026 16:253,57418,394,0787,791,0001,144,0002,117,632