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 listSep 18, 2025 00:03Suhas NarreddySuhas NarreddyScore: 2,065,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2025 00:032,041,30316,976,003,37016,879,843,00062,969,0002,277,376
2Sep 18, 2025 00:032,065,08117,170,559,14417,076,206,00063,970,0002,277,376
3Sep 18, 2025 00:032,065,27317,175,949,83317,065,809,00075,959,0002,269,184
4Sep 18, 2025 00:032,065,86017,183,465,77317,078,676,00067,962,0002,277,376
5Sep 18, 2025 00:032,065,90417,177,878,22717,080,038,00066,968,0002,277,376
6Sep 18, 2025 00:032,066,24617,184,194,36117,082,873,00066,968,0002,289,664
7Sep 18, 2025 00:032,067,00017,187,299,51617,072,140,00083,961,0002,277,376
8Sep 18, 2025 00:032,070,14517,214,285,52417,097,247,00084,956,0002,285,568
9Sep 18, 2025 00:032,070,44817,216,875,08317,124,749,00059,967,0002,285,568