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 listMay 25, 2025 17:18Alexander KrivolapovAlexander KrivolapovScore: 15,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 17:1815,668152,413,271128,048,0002,000,0002,359,296
2May 25, 2025 17:1815,670160,192,545129,061,0001,000,0002,359,296
3May 25, 2025 17:1815,672153,924,044128,079,0002,001,0002,359,296
4May 25, 2025 17:1815,687159,190,269128,199,0002,003,0002,285,568
5May 25, 2025 17:1815,699151,537,054128,297,0002,004,0002,285,568
6May 25, 2025 17:1815,711163,477,230128,414,0001,990,0002,359,296
7May 25, 2025 17:1815,714158,260,050129,425,0001,003,0002,285,568
8May 25, 2025 17:1815,721159,293,081129,482,0001,003,0002,285,568
9May 25, 2025 17:1815,733157,261,206130,588,00002,277,376