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:40sheryllynn24sheryllynn24Score: 6,610Success
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:406,60585,620,10552,826,0001,993,0002,523,136
2Sep 26, 2025 16:406,60681,553,24452,837,0001,993,0002,285,568
3Sep 26, 2025 16:406,60784,539,84652,843,0001,994,0002,285,568
4Sep 26, 2025 16:406,60882,444,32453,851,000997,0002,285,568
5Sep 26, 2025 16:406,60880,012,18952,851,0001,994,0002,265,088
6Sep 26, 2025 16:406,60982,662,58853,855,000997,0002,510,848
7Sep 26, 2025 16:406,61081,285,47052,865,0001,994,0002,285,568
8Sep 26, 2025 16:406,61486,067,35453,899,000998,0002,285,568
9Sep 26, 2025 16:406,62383,371,46652,969,0001,998,0002,269,184
10Sep 26, 2025 16:406,74283,854,18253,963,0001,998,0002,285,568
11Sep 26, 2025 16:406,74485,640,64953,979,0001,999,0002,265,088
12Sep 26, 2025 16:406,74782,345,13454,003,0002,000,0002,285,568