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 listFeb 17, 2026 21:05wnwnScore: 11,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 21:059,992111,396,17281,937,000999,0002,273,280
2Feb 17, 2026 21:0510,015105,992,07081,122,0002,003,0002,269,184
3Feb 17, 2026 21:0510,020106,214,36181,164,0002,004,0002,265,088
4Feb 17, 2026 21:0511,168121,095,98690,701,0001,993,0002,293,760
5Feb 17, 2026 21:0511,177115,965,04191,771,000997,0002,285,568
6Feb 17, 2026 21:0511,397123,787,21093,592,0001,006,0002,293,760