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 00:10Elijah KinElijah KinScore: 3,116Success
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 00:133,07316,733,4516,520,0001,164,0002,117,632
2Jun 4, 2026 00:133,08716,798,1696,553,0001,165,0002,117,632
3Jun 4, 2026 00:133,10416,831,2646,590,0001,172,0002,117,632
4Jun 4, 2026 00:133,11416,960,0376,600,0001,187,0002,117,632
5Jun 4, 2026 00:133,11617,176,2396,623,0001,168,0002,117,632
6Jun 4, 2026 00:133,16217,388,6756,805,0001,100,0002,117,632
7Jun 4, 2026 00:133,18119,480,0786,840,0001,114,0002,117,632
8Jun 4, 2026 00:133,18817,046,9336,872,0001,098,0002,117,632
9Jun 4, 2026 00:133,26017,431,3937,053,0001,099,0002,117,632