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:31Elijah KinElijah KinScore: 3,562Success
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:353,38717,448,3267,354,0001,115,0002,117,632
2Jun 3, 2026 16:353,39317,652,0717,346,0001,138,0002,117,632
3Jun 3, 2026 16:353,39417,481,7447,360,0001,126,0002,117,632
4Jun 3, 2026 16:353,49217,640,4497,617,0001,114,0002,117,632
5Jun 3, 2026 16:353,56217,921,8207,758,0001,147,0002,117,632
6Jun 3, 2026 16:353,57020,306,5107,753,0001,172,0002,117,632
7Jun 3, 2026 16:353,60318,075,4447,841,0001,168,0002,117,632
8Jun 3, 2026 16:353,60820,269,3537,831,0001,190,0002,117,632
9Jun 3, 2026 16:353,61618,488,4257,857,0001,184,0002,117,632