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 listMay 10, 2026 13:14wnwnScore: 3,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:153,41838,882,08228,375,00002,113,536
2May 10, 2026 13:153,43339,142,48328,498,00002,113,536
3May 10, 2026 13:153,43436,968,46028,504,00002,113,536
4May 10, 2026 13:153,43635,967,17528,525,00002,113,536
5May 10, 2026 13:153,44138,633,89628,564,00002,113,536
6May 10, 2026 13:153,44335,967,19528,585,00002,113,536
7May 10, 2026 13:153,44936,119,69928,634,00002,113,536
8May 10, 2026 13:153,46339,477,91428,750,00002,113,536
9May 10, 2026 13:153,48738,316,04528,947,00002,113,536