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 listMay 17, 2026 16:02Jacob McDanielJacob McDanielScore: 3,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 16:083,54018,030,9717,609,0001,243,0002,117,632
2May 17, 2026 16:083,57919,523,8487,680,0001,268,0002,117,632
3May 17, 2026 16:083,59227,123,6127,660,0001,322,0002,121,728
4May 17, 2026 16:083,63223,352,1777,774,0001,306,0002,121,728
5May 17, 2026 16:083,69421,246,6597,946,0001,290,0002,117,632
6May 17, 2026 16:083,75225,948,6347,188,0002,194,0002,113,536
7May 17, 2026 16:083,76419,283,2798,086,0001,324,0002,117,632
8May 17, 2026 16:083,88118,959,1947,439,0002,264,0002,121,728
9May 17, 2026 16:083,92819,916,4107,551,0002,269,0002,113,536