Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 31, 2025 20:10DmitryDmitryScore: 2,021,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2025 20:102,020,72016,806,507,65716,714,006,00057,968,0002,265,088
2Oct 31, 2025 20:102,020,75916,808,260,70816,715,327,00056,973,0002,277,376
3Oct 31, 2025 20:102,020,98816,803,744,49116,723,230,00050,973,0002,285,568
4Oct 31, 2025 20:102,020,99416,803,612,35216,708,284,00065,965,0002,260,992
5Oct 31, 2025 20:102,021,07616,810,539,58916,698,963,00075,967,0002,289,664
6Oct 31, 2025 20:102,021,11016,805,871,79916,699,249,00075,964,0002,277,376
7Oct 31, 2025 20:102,021,20516,811,051,24516,722,028,00053,974,0002,277,376
8Oct 31, 2025 20:102,024,96316,840,801,08316,750,221,00056,973,0002,277,376
9Oct 31, 2025 20:102,109,13517,536,246,00017,443,852,00061,971,0002,277,376