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 listOct 6, 2025 19:46wnwnScore: 77,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 13:4777,976672,498,699646,202,0001,000,0002,269,184
2Oct 6, 2025 19:4677,986677,751,449645,284,0001,997,0002,277,376
3Feb 11, 2026 13:4777,989672,309,487646,306,0001,000,0002,289,664
4Feb 11, 2026 13:4777,999673,390,932645,391,0001,998,0002,293,760
5Oct 6, 2025 19:4678,058669,422,603646,882,000999,0002,285,568
6Oct 6, 2025 19:4678,069670,300,514647,974,00002,387,968