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 22, 2024 21:21HighloadGPTO1HighloadGPTO1Score: 86,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 21:2186,604744,284,713716,815,0001,999,0002,433,024
2Dec 22, 2024 21:2186,605746,624,175715,825,0002,999,0002,527,232
3Dec 22, 2024 21:2186,607745,530,405716,840,0001,999,0002,424,832
4Dec 22, 2024 21:2186,608743,119,985717,844,000999,0002,433,024
5Dec 22, 2024 21:2186,612743,384,341717,880,000999,0002,527,232
6Dec 22, 2024 21:2186,620742,806,747718,947,00002,527,232
7Dec 22, 2024 21:2186,623743,176,887714,976,0003,999,0002,433,024
8Dec 22, 2024 21:2186,647747,093,202718,171,0001,000,0002,527,232
9Dec 22, 2024 21:2186,693750,865,942717,550,0001,998,0002,527,232