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 8, 2026 23:55Elijah KinElijah KinScore: 2,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 23:552,04414,186,5273,861,0001,249,0002,117,632
2Jun 8, 2026 23:552,06414,160,2223,905,0001,257,0002,117,632
3Jun 8, 2026 23:552,06814,315,5473,921,0001,250,0002,117,632
4Jun 8, 2026 23:552,26114,762,3734,392,0001,262,0002,117,632
5Jun 8, 2026 23:552,26414,740,7374,412,0001,248,0002,117,632
6Jun 8, 2026 23:552,32716,600,2594,568,0001,250,0002,117,632
7Jun 8, 2026 23:552,33814,976,6114,587,0001,258,0002,117,632
8Jun 8, 2026 23:552,34215,061,7984,728,0001,128,0002,117,632
9Jun 8, 2026 23:552,35114,917,9614,640,0001,239,0002,117,632