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 listApr 27, 2026 05:41wnwnScore: 3,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:413,40046,401,86527,219,0001,008,0002,482,176
2Apr 27, 2026 05:413,42741,498,41527,431,0001,015,0002,551,808
3Apr 27, 2026 05:413,43046,599,26827,459,0001,017,0002,478,080
4Apr 27, 2026 05:413,47342,624,05126,845,0001,988,0002,318,336
5Apr 27, 2026 05:413,47850,744,69726,882,0001,991,0002,330,624
6Apr 27, 2026 05:413,48645,308,23426,946,0001,996,0002,478,080
7Apr 27, 2026 05:413,49046,212,99126,971,0001,997,0002,486,272
8Apr 27, 2026 05:413,57646,578,67327,707,0001,979,0002,490,368
9Apr 27, 2026 05:413,64848,740,87029,273,0001,009,0002,330,624