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 listApr 29, 2026 05:12olliecrowolliecrowScore: 4,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 05:144,23826,300,1058,476,0002,119,0002,387,968
2Apr 29, 2026 05:144,25230,481,5898,505,0002,126,0002,392,064
3Apr 29, 2026 05:144,25428,950,9817,446,0003,191,0002,310,144
4Apr 29, 2026 05:144,26630,664,6929,599,0001,066,0002,396,160
5Apr 29, 2026 05:144,28132,520,2849,633,0001,070,0002,387,968
6Apr 29, 2026 05:144,32327,929,3567,566,0003,242,0002,396,160
7Apr 29, 2026 05:144,45530,697,4966,076,0005,063,0002,396,160
8Apr 29, 2026 05:144,46530,187,34710,149,0001,014,0002,392,064
9Apr 29, 2026 05:144,47130,418,2337,114,0004,065,0002,392,064