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 5, 2025 15:21Petro MudrievskyjPetro MudrievskyjScore: 30,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2025 15:2130,422280,084,342251,503,0001,002,0002,285,568
2Sep 5, 2025 15:2130,475281,020,901250,943,0001,999,0002,285,568
3Sep 5, 2025 15:2130,477277,367,974250,964,0001,999,0002,269,184
4Sep 5, 2025 15:2130,499275,339,235251,139,0002,001,0002,285,568
5Sep 5, 2025 15:2130,500284,993,237252,151,0001,000,0002,277,376
6Sep 5, 2025 15:2130,510274,430,913252,233,0001,000,0002,277,376
7Sep 5, 2025 15:2130,511273,214,033251,237,0002,001,0002,285,568
8Sep 5, 2025 15:2130,518275,299,214251,296,0002,002,0002,269,184
9Sep 5, 2025 15:2130,546287,021,276252,529,0001,002,0002,273,280