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 listApr 23, 2025 21:03Alona MalohAlona MalohScore: 188,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 21:03187,9681,588,905,6721,498,172,00061,965,0002,285,568
2Apr 23, 2025 21:03188,0191,584,513,6891,510,576,00049,985,0002,285,568
3Apr 23, 2025 21:03188,0371,583,473,8151,514,717,00045,991,0002,260,992
4Apr 23, 2025 21:03188,0461,584,690,1481,506,788,00053,992,0002,519,040
5Apr 23, 2025 21:03188,0701,589,678,8961,504,020,00056,962,0002,285,568
6Apr 23, 2025 21:03188,0851,582,589,2251,489,148,00071,958,0002,285,568
7Apr 23, 2025 21:03188,0921,585,537,3611,500,196,00060,967,0002,375,680
8Apr 23, 2025 21:03188,1321,592,344,7281,503,518,00057,981,0002,265,088
9Apr 23, 2025 21:03188,1501,589,687,2031,520,652,00040,990,0002,285,568