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 26, 2025 16:37sheryllynn24sheryllynn24Score: 6,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 16:376,64184,590,22153,115,0002,004,0002,285,568
2Sep 26, 2025 16:376,64182,773,15554,121,0001,002,0002,277,376
3Sep 26, 2025 16:376,64380,643,06554,131,0001,002,0002,285,568
4Sep 26, 2025 16:376,64485,262,28854,144,0001,002,0002,285,568
5Sep 26, 2025 16:376,64480,936,11353,142,0002,005,0002,519,040
6Sep 26, 2025 16:376,64882,838,07654,174,0001,003,0002,285,568
7Sep 26, 2025 16:376,65683,173,54954,242,0001,004,0002,265,088
8Sep 26, 2025 16:376,66486,042,22553,297,0002,011,0002,285,568
9Sep 26, 2025 16:376,67278,405,86055,380,00002,265,088
10Sep 26, 2025 16:376,77884,350,00254,250,0002,009,0002,285,568
11Sep 26, 2025 16:376,78577,228,49754,307,0002,011,0002,265,088
12Sep 26, 2025 16:376,81079,302,36255,513,0001,009,0002,285,568