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 04:12Elijah KinElijah KinScore: 2,985Success
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 04:132,90216,637,3865,688,0001,567,0002,117,632
2Jun 9, 2026 04:132,92016,381,7525,751,0001,549,0002,117,632
3Jun 9, 2026 04:132,94116,462,8235,860,0001,494,0002,117,632
4Jun 9, 2026 04:132,95216,450,0685,868,0001,512,0002,117,632
5Jun 9, 2026 04:132,98516,523,4715,982,0001,482,0002,117,632
6Jun 9, 2026 04:133,05416,676,9976,057,0001,579,0002,117,632
7Jun 9, 2026 04:133,06416,720,7946,152,0001,510,0002,117,632
8Jun 9, 2026 04:133,09216,766,0536,218,0001,512,0002,117,632
9Jun 9, 2026 04:133,11316,873,9466,287,0001,497,0002,117,632