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 listAug 13, 2025 16:15Andrija ZarićAndrija ZarićScore: 162,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2025 16:15161,7971,377,039,2451,342,917,00002,285,568
2Aug 13, 2025 16:15162,8231,374,573,1441,349,430,0001,999,0002,285,568
3Aug 13, 2025 16:15162,9131,378,064,5021,352,175,00002,359,296
4Aug 13, 2025 16:15162,9161,382,702,5131,350,206,0001,998,0002,285,568
5Aug 13, 2025 16:15162,9261,377,412,9361,351,287,000999,0002,359,296
6Aug 13, 2025 16:15162,9271,377,031,7081,351,299,000999,0002,281,472
7Aug 13, 2025 16:15162,9971,380,228,8771,351,875,000999,0002,285,568
8Aug 13, 2025 16:15163,0141,382,136,0841,351,016,0001,998,0002,285,568
9Aug 13, 2025 16:15163,0301,380,971,6621,351,154,0001,998,0002,281,472