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 listSep 15, 2026 17:59Josu San MartinJosu San MartinScore: 2,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 17:592,76015,556,3265,791,0001,109,0002,117,632
2Sep 15, 2026 17:592,83415,742,4655,964,0001,123,0002,117,632
3Sep 15, 2026 17:592,83415,787,5275,961,0001,126,0002,117,632
4Sep 15, 2026 17:592,83915,665,6775,974,0001,125,0002,117,632
5Sep 15, 2026 17:592,83915,654,5185,974,0001,125,0002,117,632
6Sep 15, 2026 17:592,84015,699,6855,975,0001,126,0002,117,632
7Sep 15, 2026 17:592,84215,548,3435,979,0001,128,0002,117,632
8Sep 15, 2026 17:592,84415,714,3235,986,0001,126,0002,117,632
9Sep 15, 2026 17:592,84915,672,9685,993,0001,130,0002,117,632