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 listDec 29, 2025 14:20Aman | अमनAman | अमनScore: 53,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 14:2053,304470,245,456441,421,0001,000,0002,523,136
2Dec 29, 2025 14:2053,326468,660,035440,611,0001,998,0002,510,848
3Dec 29, 2025 14:2053,329468,511,295440,631,0001,998,0002,387,968
4Dec 29, 2025 14:2053,329466,444,412440,632,0001,998,0002,519,040
5Dec 29, 2025 14:2053,338469,027,951441,710,000999,0002,519,040
6Dec 29, 2025 14:2053,342470,987,124440,740,0001,998,0002,519,040
7Dec 29, 2025 14:2053,343474,204,408441,745,000999,0002,392,064
8Dec 29, 2025 14:2053,343469,033,120440,747,0001,998,0002,260,992
9Dec 29, 2025 14:2053,344476,741,064440,754,0001,998,0002,392,064