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 18:11sheryllynn24sheryllynn24Score: 6,626Success
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 18:116,49985,785,38451,945,0001,997,0002,285,568
2Sep 26, 2025 18:116,50178,766,95751,962,0001,998,0002,519,040
3Sep 26, 2025 18:116,50691,443,19151,999,0001,999,0002,285,568
4Sep 26, 2025 18:116,62680,253,26352,994,0001,999,0002,269,184
5Sep 26, 2025 18:116,63884,006,26253,089,0002,003,0002,285,568
6Sep 26, 2025 18:116,63980,429,87853,103,0002,003,0002,285,568