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 4, 2026 17:52Elijah KinElijah KinScore: 4,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 17:534,05019,231,4546,860,0003,265,0002,117,632
2Jun 4, 2026 17:534,07220,870,5896,893,0003,289,0002,117,632
3Jun 4, 2026 17:534,07419,323,1636,888,0003,299,0002,117,632
4Jun 4, 2026 17:534,08620,890,5066,903,0003,314,0002,117,632
5Jun 4, 2026 17:534,08619,411,8506,903,0003,312,0002,117,632
6Jun 4, 2026 17:534,10419,449,1756,940,0003,320,0002,117,632
7Jun 4, 2026 17:534,12619,373,6116,961,0003,354,0002,117,632
8Jun 4, 2026 17:534,17719,545,9407,164,0003,280,0002,117,632
9Jun 4, 2026 17:534,24219,704,6967,184,0003,421,0002,117,632